Sciweavers

964 search results - page 7 / 193
» Efficiently Ordering Query Plans for Data Integration
Sort
View
ICDE
2006
IEEE
188views Database» more  ICDE 2006»
15 years 10 months ago
Efficiently Evaluating Order Preserving Similarity Queries over Historical Market-Basket Data
We introduce a new domain-independent framework for formulating and efficiently evaluating similarity queries over historical data, where given a history as a sequence of timestam...
Reza Sherkat, Davood Rafiei
SIGMOD
2001
ACM
120views Database» more  SIGMOD 2001»
15 years 9 months ago
Materialized View Selection and Maintenance Using Multi-Query Optimization
Materialized views have been found to be very effective at speeding up queries, and are increasingly being supported by commercial databases and data warehouse systems. However, w...
Hoshi Mistry, Prasan Roy, S. Sudarshan, Krithi Ram...
PODS
2006
ACM
138views Database» more  PODS 2006»
15 years 9 months ago
Efficiently ordering subgoals with access constraints
d Abstract] Guizhen Yang Artificial Intelligence Center SRI International Menlo Park, CA 94025, USA Michael Kifer Dept. of Computer Science Stony Brook University Stony Brook, NY 1...
Guizhen Yang, Michael Kifer, Vinay K. Chaudhri
ICDE
2005
IEEE
240views Database» more  ICDE 2005»
15 years 10 months ago
Adaptive Processing of Top-K Queries in XML
The ability to compute top-k matches to XML queries is gaining importance due to the increasing number of large XML repositories. The efficiency of top-k query evaluation relies o...
Amélie Marian, Divesh Srivastava, Nick Koud...
SIGMOD
2009
ACM
202views Database» more  SIGMOD 2009»
15 years 9 months ago
ZStream: a cost-based query processor for adaptively detecting composite events
Composite (or Complex) event processing (CEP) systems search sequences of incoming events for occurrences of userspecified event patterns. Recently, they have gained more attentio...
Yuan Mei, Samuel Madden