Sciweavers

332 search results - page 40 / 67
» Space Complexity vs. Query Complexity
Sort
View
GEOINFO
2004
13 years 11 months ago
Approximate Spatial Query Processing using Raster Signatures
: Nowadays, the database characteristics, such as the huge volume of data, the complexity of the queries, and even the data availability, can demand minutes or hours to process a q...
Leonardo Guerreiro Azevedo, Rodrigo Salvador Monte...
SIGMOD
2003
ACM
240views Database» more  SIGMOD 2003»
14 years 10 months ago
XRANK: Ranked Keyword Search over XML Documents
We consider the problem of efficiently producing ranked results for keyword search queries over hyperlinked XML documents. Evaluating keyword search queries over hierarchical XML ...
Lin Guo, Feng Shao, Chavdar Botev, Jayavel Shanmug...
VLDB
1999
ACM
89views Database» more  VLDB 1999»
14 years 2 months ago
Physical Data Independence, Constraints, and Optimization with Universal Plans
We present an optimization method and algorithm designed for three objectives: physical data independence, semantic optimization, and generalized tableau minimization. The method ...
Alin Deutsch, Lucian Popa, Val Tannen
SIGMOD
1996
ACM
120views Database» more  SIGMOD 1996»
14 years 2 months ago
Implementing Data Cubes Efficiently
Decision support applications involve complex queries on very large databases. Since response times should be small, query optimization is critical. Users typically view the data ...
Venky Harinarayan, Anand Rajaraman, Jeffrey D. Ull...
PVLDB
2010
103views more  PVLDB 2010»
13 years 8 months ago
Fast Optimal Twig Joins
In XML search systems twig queries specify predicates on node values and on the structural relationships between nodes, and a key operation is to join individual query node matche...
Nils Grimsmo, Truls Amundsen Bjørklund, Mag...