Sciweavers

3368 search results - page 244 / 674
» The Complexity of Query Reliability
Sort
View
DEBS
2009
ACM
16 years 1 months ago
Distributed event stream processing with non-deterministic finite automata
Efficient matching of incoming events to persistent queries is fundamental to event pattern matching, complex event processing, and publish/subscribe systems. Recent processing e...
Lars Brenna, Johannes Gehrke, Mingsheng Hong, Dag ...
SSD
2005
Springer
116views Database» more  SSD 2005»
16 years 2 days ago
PA-Tree: A Parametric Indexing Scheme for Spatio-temporal Trajectories
Abstract. Many new applications involving moving objects require the collection and querying of trajectory data, so efficient indexing methods are needed to support complex spatio...
Jinfeng Ni, Chinya V. Ravishankar
VLDB
2001
ACM
190views Database» more  VLDB 2001»
15 years 11 months ago
LEO - DB2's LEarning Optimizer
Most modern DBMS optimizers rely upon a cost model to choose the best query execution plan (QEP) for any given query. Cost estimates are heavily dependent upon the optimizer’s e...
Michael Stillger, Guy M. Lohman, Volker Markl, Mok...
CIKM
2006
Springer
15 years 8 months ago
Efficient range-constrained similarity search on wavelet synopses over multiple streams
Due to the resource limitation in the data stream environment, it has been reported that answering user queries according to the wavelet synopsis of a stream is an essential abili...
Hao-Ping Hung, Ming-Syan Chen
ICDE
2005
IEEE
107views Database» more  ICDE 2005»
16 years 8 months ago
Spatiotemporal Annotation Graph (STAG): A Data Model for Composite Digital Objects
In this demonstration, we present a database over complex documents, which, in addition to a structured text content, also has update information, annotations, and embedded object...
Smriti Yamini, Amarnath Gupta