613 search results - page 44 / 123 » Query Evaluation on a Database Given by a Random Graph |
210
Voted
ICDE
2001
IEEE
16 years 5 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...
133
Voted
APWEB
2004
Springer
15 years 9 months ago
2004
Springer
In a state-of-the-art XML database, an XML query is evaluated as a sequence of structural joins in which positions of data nodes are used to perform each individual structural joi...
162
Voted
PODS
1995
ACM
15 years 7 months ago
1995
ACM
Databases are often incomplete because of the presence of disjunctive information, due to con icts, partial knowledge and other reasons. Queries against such databases often ask q...
120
Voted
DEXAW
1998
IEEE
15 years 8 months ago
1998
IEEE
Materialized views offer opportunities for significant performance gain in query evaluation by providing fast access to pre-computed data. The question of when and how to use a ma...
142
Voted
PODS
2006
ACM
16 years 3 months ago
2006
ACM
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...