486 search results - page 6 / 98 » An Efficient Path Index for Querying Semi-structured Data |
115
click to vote
ADC
2008
Springer
15 years 6 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...
112
click to vote
PVLDB
2010
14 years 6 months ago
2010
A Cloud may be seen as a type of flexible computing infrastructure consisting of many compute nodes, where resizable computing capacities can be provided to different customers. T...
95
Voted
DEXAW
2005
IEEE
15 years 1 months ago
2005
IEEE
In this paper, we study semistructured data and indexes preserving inclusion constraints. A semistructured datum is modelled by multi-rooted edge-labeled directed graphs. We consi...
97
Voted
WEBDB
2001
Springer
15 years 4 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 ...
SEBD
1996
15 years 29 days ago
1996
Abstract. To select an optimal query evaluation strategy for a path query in an object-oriented database system one has to exploit the available index structures on the path. In a ...