Sciweavers

7640 search results - page 335 / 1528
» Event Database Processing
Sort
View
ICDE
2007
IEEE
206views Database» more  ICDE 2007»
16 years 5 months ago
Efficiently Processing Continuous k-NN Queries on Data Streams
Efficiently processing continuous k-nearest neighbor queries on data streams is important in many application domains, e. g. for network intrusion detection or in querysubscriber ...
Beng Chin Ooi, Christian Böhm, Claudia Plant,...
ICDE
2005
IEEE
123views Database» more  ICDE 2005»
16 years 5 months ago
High-Availability Algorithms for Distributed Stream Processing
Stream-processing systems are designed to support an emerging class of applications that require sophisticated and timely processing of high-volume data streams, often originating...
Alex Rasin, Jeong-Hyon Hwang, Magdalena Balazinska...
ICDT
2009
ACM
109views Database» more  ICDT 2009»
16 years 4 months ago
TOP-K projection queries for probabilistic business processes
A Business Process (BP) consists of some business activities undertaken by one or more organizations in pursuit of some business goal. Tools for querying and analyzing BP specific...
Daniel Deutch, Tova Milo
WWW
2005
ACM
16 years 4 months ago
TJFast: effective processing of XML twig pattern matching
Finding all the occurrences of a twig pattern in an XML database is a core operation for efficient evaluation of XML queries. A number of algorithms have been proposed to process ...
Jiaheng Lu, Ting Chen, Tok Wang Ling
VLDB
2007
ACM
169views Database» more  VLDB 2007»
16 years 4 months ago
Staying FIT: Efficient Load Shedding Techniques for Distributed Stream Processing
In distributed stream processing environments, large numbers of continuous queries are distributed onto multiple servers. When one or more of these servers become overloaded due t...
Nesime Tatbul, Stanley B. Zdonik, Ugur Çeti...