486 search results - page 13 / 98 » An Efficient Path Index for Querying Semi-structured Data |
CIKM
2009
Springer
15 years 6 months ago
2009
Springer
Well-designed indices can dramatically improve query performance. Including query workload information can produce indices that yield better overall throughput while balancing the...
112
click to vote
CIKM
2009
Springer
15 years 3 months ago
2009
Springer
Current approaches to RDF graph indexing suffer from weak data locality, i.e., information regarding a piece of data appears in multiple locations, spanning multiple data structur...
167
click to vote
ICDE
2005
IEEE
16 years 1 months ago
2005
IEEE
The filtering of XML data is the basis of many complex applications. Lots of algorithms have been proposed to solve this problem[2, 3, 5, 6, 7, 8, 9, 11, 12, 13, 18]. One importan...
105
click to vote
EDBT
2004
ACM
15 years 11 months ago
2004
ACM
Despite the existence of obstacles in many database applications, traditional spatial query processing utilizes the Euclidean distance metric assuming that points in space are dire...
175
click to vote
ICDE
2006
IEEE
16 years 1 months ago
2006
IEEE
Graphs have become popular for modeling structured data. As a result, graph queries are becoming common and graph indexing has come to play an essential role in query processing. ...