1429 search results - page 49 / 286 » Efficient processing of XPath queries using indexes |
171
click to vote
SSDBM
2003
IEEE
15 years 11 months ago
2003
IEEE
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existin...
276
click to vote
ICDE
2009
IEEE
16 years 7 months ago
2009
IEEE
Abstract-- Particle simulation has become an important research tool in many scientific and engineering fields. Data generated by such simulations impose great challenges to databa...
167
click to vote
SSD
2001
Springer
15 years 10 months ago
2001
Springer
Intervals represent a fundamental data type for temporal, scientific, and spatial databases where time stamps and point data are extended to time spans and range data, respectively...
151
click to vote
SIGMOD
1994
ACM
15 years 10 months ago
1994
ACM
We present a framework which allows the user to access and manipulate data uniformly, regardless of whether it resides in a database or in the file system (or in both). A key issu...
151
click to vote
CIKM
2010
Springer
15 years 4 months ago
2010
Springer
Traditional interactive information retrieval systems function by creating inverted lists, or term indexes. For every term in the vocabulary, a list is created that contains the d...