|
| | | |
Faster Path Indexes for Search in XML Data
Grimsmo, N.
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 faster than previous methods
when facing path queries using the descendant
axis and wild-cards. The first is conceptually simple
and combines inverted lists, selectivity estimation, hit
expansion and brute force search. The second uses
suffix trees with additional statistics and multiple entry
points into the query. The entry points are partially
evaluated in an order based on estimated cost
until one of them is complete. Many path index implementations
are tested, using paths generated both
from statistical models and DTDs. |
Cite as: Grimsmo, N. (2008). Faster Path Indexes for Search in XML Data. In Proc. Nineteenth Australasian Database Conference (ADC 2008), Wollongong, NSW, Australia. CRPIT, 75. Fekete, A. and Lin, X., Eds. ACS. 127-135. |
(from crpit.com)
(local if available)
|
|