Sciweavers

3225 search results - page 92 / 645
» Query Optimization by Stored Queries
Sort
View
COMGEO
2008
ACM
13 years 9 months ago
Lower bounds for expected-case planar point location
Given a planar polygonal subdivision S, the point location problem is to preprocess S into a data structure so that the cell of the subdivision that contains a given query point c...
Theocharis Malamatos
SIGMOD
2003
ACM
105views Database» more  SIGMOD 2003»
14 years 9 months ago
Factorizing Complex Predicates in Queries to Exploit Indexes
Decision-support applications generate queries with complex predicates. We show how the factorization of complex query expressions exposes significant opportunities for exploiting...
Surajit Chaudhuri, Prasanna Ganesan, Sunita Sarawa...
DMDW
2000
116views Management» more  DMDW 2000»
13 years 10 months ago
Divide and aggregate: caching multidimensional objects
A common optimization technique in the OLAP application domain is the use of summary aggregate data. For an appropriate support of analysis hot spots, we propose a query based agg...
Wolfgang Lehner, Jens Albrecht, Wolfgang Hümm...
BDA
2007
13 years 10 months ago
PeerSum: Summary Management in P2P Systems
Sharing huge, massively distributed databases in P2P systems is inherently difficult. As the amount of stored data increases, data localization techniques become no longer suffi...
Rabab Hayek, Guillaume Raschia, Patrick Valduriez,...
CINQ
2004
Springer
163views Database» more  CINQ 2004»
14 years 2 months ago
Frequent Itemset Discovery with SQL Using Universal Quantification
Algorithms for finding frequent itemsets fall into two broad classes: (1) algorithms that are based on non-trivial SQL statements to query and update a database, and (2) algorithms...
Ralf Rantzau