72 search results - page 6 / 15 » On the Selection of Optimal Index Configuration in OO Databa... |
WWW
2004
ACM
14 years 8 months ago
2004
ACM
The overwhelming success of the Web as a mechanism for facilitating information retrieval and for conducting business transactions has led to an increase in the deployment of comp...
VLDB
2007
ACM
14 years 7 months ago
2007
ACM
Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g D such that q contains g (q g). Due to the wide adoption of graph models, f...
SIGMOD
1994
ACM
13 years 11 months ago
1994
ACM
We describe an algorithm for estimating the number of page fetches for a partial or complete scan of a B-tree index. The algorithm obtains estimates for the number of page fetches ...
ICDE
2008
IEEE
14 years 1 months ago
2008
IEEE
Personalized PageRank, related to random walks with restarts and conductance in resistive networks, is a frequent search paradigm for graph-structured databases. While efficient ba...
SIGMOD
2005
ACM
14 years 1 months ago
2005
ACM
Appropriately selected materialized views (also called indexed views) can speed up query execution by orders of magnitude. Most database systems limit support for materialized vie...