19 search results - page 2 / 4 » Indexes and Path Constraints in Semistructured Data |
WEBDB
2001
Springer
13 years 10 months ago
2001
Springer
Indexing schemes for semistructured data have been developed in recent years to optimize path query processing by summarizing path information. However, most of these schemes can ...
ADC
2008
Springer
13 years 11 months ago
2008
Springer
This article describes how to implement efficient memory resident path indexes for semi-structured data. Two techniques are introduced, and they are shown to be significantly fas...
DEXAW
2006
IEEE
13 years 11 months ago
2006
IEEE
The effective grouping, or partitioning, of semistructured data is of fundamental importance when providing support for queries. Partitions allow items within the data set that sh...
SIGMOD
2003
ACM
14 years 5 months ago
2003
ACM
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 ...
KRDB
2001
13 years 6 months ago
2001
We analyze several classes of path constraints for semistructured data in a unified framework and prove some decidability and complexity results for these constraints by embedding...