3269 search results - page 355 / 654 » Query Optimization for XML |
111
click to vote
ICDE
2010
IEEE
16 years 4 months ago
2010
IEEE
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
139
click to vote
SIGMOD
2001
ACM
16 years 5 months ago
2001
ACM
Estimating the result size of complex queries that involve selection on multiple attributes and the join of several relations is a difficult but fundamental task in database query...
181
click to vote
COMAD
2009
15 years 6 months ago
2009
The problem of information integration is discussed in the context of answering a query over the web. Querying the web requires that information from different web and other sourc...
148
click to vote
SIGMOD
1996
ACM
15 years 9 months ago
1996
ACM
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 ...
141
click to vote
SAC
2008
ACM
15 years 4 months ago
2008
ACM
Modern applications requiring spatial network processing pose many interesting query optimization challenges. In many cases, query processing depends on the corresponding graph si...