Recognizing composite events for event-condition-action rules.
Our rough guess is there are 33,750 words in this book.
At a pace averaging 250 words per minute, this book will take 2 hours and 15 minutes to read. With a half hour per day, this will take 5 days to read.
How long will it take you?
This book will take an estimated to read at a reading speed averaging words per minute. With 30 minutes per day, this will take to read.
Enter your reading speedYou can take one of our WPM reading speed tests to find your reading speed.
Create a free account to track your reading progress, build your reading list, and set reading goals.
We earn a commission on purchases
Word Count
33,750 words, Guess
Page Count
135 pages
Identifiers
- Open LibraryOL19512431M
- ISBN-100612952843
Description
This thesis explores the problem of recognizing composite events. Our work extends the event specification language proposed in Vasiliki Kantere's M.Sc thesis titled "A Rule Mechanism for Peer-to-Peer Data Management", and proposes an efficient mechanism, the Recognizer, for composite event recognition. Among other features, the Recognizer supports different kinds of event consumption policies and unrestricted context, so it can be easily applied to different applications. The Recognizer has been implemented and evaluated under different workload assumptions.Peer-to-Peer (P2P) computing has become a popular topic in Computer Science because it offers a new paradigm for data sharing and service provision. Each peer in a P2P network is independent and autonomous, and (in our work) is assumed to own a relational database. Peers can establish (and cancel) acquaintances with other peers, and share data and services with their acquaintances. They can also coordinate their databases through Event-Condition-Action (ECA) rules.
Subjects
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!