Sciweavers

415 search results - page 49 / 83
» Efficient Processing of Relational Queries with Sum Constrai...
Sort
View
DEBS
2007
ACM
13 years 11 months ago
Temporal order optimizations of incremental joins for composite event detection
Queries for composite events typically involve the four complementary dimensions of event data, event composition, relationships between events (esp. temporal and causal), and acc...
François Bry, Michael Eckert
SIGMOD
2004
ACM
92views Database» more  SIGMOD 2004»
14 years 7 months ago
The Price of Validity in Dynamic Networks
Massive-scale self-administered networks like Peer-to-Peer and Sensor Networks have data distributed across thousands of participant hosts. These networks are highly dynamic with ...
Mayank Bawa, Aristides Gionis, Hector Garcia-Molin...
PVLDB
2008
122views more  PVLDB 2008»
13 years 6 months ago
Identifying robust plans through plan diagram reduction
Estimates of predicate selectivities by database query optimizers often differ significantly from those actually encountered during query execution, leading to poor plan choices a...
Harish D., Pooja N. Darera, Jayant R. Haritsa
SIGMOD
2007
ACM
125views Database» more  SIGMOD 2007»
14 years 7 months ago
Optimizing mpf queries: decision support and probabilistic inference
Managing uncertain data using probabilistic frameworks has attracted much interest lately in the database literature, and a central computational challenge is probabilistic infere...
Héctor Corrada Bravo, Raghu Ramakrishnan
EDBT
2009
ACM
137views Database» more  EDBT 2009»
13 years 5 months ago
Flexible and scalable storage management for data-intensive stream processing
Data Stream Management Systems (DSMS) operate under strict performance requirements. Key to meeting such requirements is to efficiently handle time-critical tasks such as managing...
Irina Botan, Gustavo Alonso, Peter M. Fischer, Don...