Sciweavers

3269 search results - page 348 / 654
» Query Optimization for XML
Sort
View
147
Voted
UAI
2003
15 years 6 months ago
Approximate Decomposition: A Method for Bounding and Estimating Probabilistic and Deterministic Queries
In this paper, we introduce a method for approximating the solution to inference and optimization tasks in uncertain and deterministic reasoning. Such tasks are in general intract...
David Larkin
160
Voted
SIGMOD
2003
ACM
239views Database» more  SIGMOD 2003»
16 years 5 months ago
D(k)-Index: An Adaptive Structural Summary for Graph-Structured Data
To facilitate queries over semi-structured data, various structural summaries have been proposed. Structural summaries are derived directly from the data and serve as indices for ...
Chen Qun, Andrew Lim, Kian Win Ong
CSR
2007
Springer
15 years 11 months ago
Marrying Words and Trees
Traditionally, data that has both linear and hierarchical structure, such as annotated linguistic data, is modeled using ordered trees and queried using tree automata. In this pap...
Rajeev Alur
WISE
2006
Springer
15 years 11 months ago
SCEND: An Efficient Semantic Cache to Adequately Explore Answerability of Views
Maintaining a semantic cache of materialized XPath views inside or outside the database, is a novel, feasible and efficient approach to accelerate XML query processing. However, th...
Guoliang Li, Jianhua Feng, Na Ta, Yong Zhang, Lizh...
153
Voted
SSDBM
2002
IEEE
122views Database» more  SSDBM 2002»
15 years 10 months ago
ATreeGrep: Approximate Searching in Unordered Trees
An unordered labeled tree is a tree in which each node has a string label and the parent-child relationship is significant, but the order among siblings is unimportant. This pape...
Dennis Shasha, Jason Tsong-Li Wang, Huiyuan Shan, ...