902 search results - page 29 / 181 » Efficient and Extensible Algorithms for Multi Query Optimiza... |
VLDB
2002
ACM
14 years 8 months ago
2002
ACM
Several organizations have developed very large market basket databases for the maintenance of customer transactions. New applications, e.g., Web recommendation systems, present th...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Previous work reports about SXSI, a fast XPath engine which executes tree automata over compressed XML indexes. Here, reasons are investigated why SXSI is so fast. It is shown tha...
VLSID
2008
IEEE
14 years 8 months ago
2008
IEEE
Today's customizable processors allow the designer to augment the base processor with custom accelerators. By choosing appropriate set of accelerators, designer can significa...
ADBIS
1998
Springer
14 years 21 days ago
1998
Springer
In order to answer efficiently range queries in 2-d R-trees, first we sort queries by means of a space filling curve, then we group them together, and finally pass them for process...
ADBIS
2009
Springer
13 years 6 months ago
2009
Springer
We consider the problem of selecting views and indexes that minimize the evaluation costs of the important queries under an upper bound on the disk space available for storing the ...