491 search results - page 15 / 99 » Optimizing Large OODB Queries |
167
click to vote
VLDB
2007
ACM
15 years 9 months ago
2007
ACM
We investigate the problem of how to evaluate efficiently a collection of shortest path queries on massive graphs that are too big to fit in the main memory. To evaluate a shortes...
SIGMOD
2001
ACM
15 years 9 months ago
2001
ACM
Materialized views can provide massive improvements in query processing time, especially for aggregation queries over large tables. To realize this potential, the query optimizer ...
SIGMOD
2002
ACM
15 years 9 months ago
2002
ACM
Statistics play an important role in influencing the plans produced by a query optimizer. Traditionally, optimizers use statistics built over base tables and assume independence b...
158
click to vote
ICDE
2001
IEEE
15 years 11 months ago
2001
IEEE
We describe efficient algorithms for accurately estimating the number of matches of a small node-labeled tree, i.e., a twig, in a large node-labeled tree, using a summary data str...
100
click to vote
INFOSCALE
2007
ACM
14 years 11 months ago
2007
ACM
Large-scale Parallel Web Search Engines (WSEs) needs to adopt a strategy for partitioning the inverted index among a set of parallel server nodes. In this paper we are interested ...