Tim Furche, Giovanni Grasso, Michael Huemer, Christian Schallhart, Michael Schrefl,
"Bitemporal Complex Event Processing of Web Event Advertisements"
, in Xuemin Lin, Yannis Manolopoulos, Divesh Srivastava, Guangan Huang (eds.): Proceedings of the 14th International Conference on Web iNformation System Engineering (WISE 2013), Nanjing, China, October 13-15, 2013, Serie Lecture Notes in Computer Science (LNCS), Vol. 8181, Springer Verlag, Seite(n) 333-346, 10-2013, ISBN: 978-3642411533
Bitemporal Complex Event Processing of Web Event Advertisements
Sprache des Titels:
Proceedings of the 14th International Conference on Web iNformation System Engineering (WISE 2013), Nanjing, China, October 13-15, 2013
The web is the largest bulletin board of the world. Events of all types, from flight arrivals to business meetings, are announced on this board. Tracking and reacting to such event announcements, however, is a tedious manual task, only slightly alleviated by email or similar notifications. Announcements are published with human readers in mind, and updates or delayed announcements are frequent. These characteristics have hampered attempts at automatic tracking.
PEACE provides the first integrated framework for event processing on top of web event ads. Given a schema of events to be tracked, the framework populates this schema through compact wrappers for event announcement sources. These wrappers produce events including updates and retractions. PEACE then queries these events to detect complex events, often combining announcements from multiple sources. To deal with updates and delayed announcements, PEACE?s schemas are bitemporal so as to distinguish between occurrence and detection time. This allows complex event specifications to track updates and to react to differences in occurrence and detection time. Our evaluation shows that extracting the event from an announcement dominates the processing of PEACE and that the complex event processor deals with several event announcement sources even with moderate resources. We further show, that simple restrictions on the complex event specifications suffice to guarantee that PEACE only requires a constant buffer to process arbitrarily many event announcements.