1429 search results - page 12 / 286 » Efficient processing of XPath queries using indexes |
SIGMOD
2006
ACM
14 years 7 months ago
2006
ACM
Modern scientific applications consume massive volumes of data produced by computer simulations. Such applications require new data management capabilities in order to scale to te...
ICDE
2008
IEEE
14 years 8 months ago
2008
IEEE
Abstract-- Current twig join algorithms incur high memory costs on queries that involve child-axis nodes. In this paper we provide an analytical explanation for this phenomenon. In...
GEOINFO
2003
13 years 8 months ago
2003
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 existing...
ICDE
2003
IEEE
14 years 8 months ago
2003
IEEE
We are witnessing in recent years growing interest for location-dependent information services among mobile users. This paper examines the issue of processing locationdependent qu...
ICDE
2006
IEEE
14 years 8 months ago
2006
IEEE
Linguistic research and natural language processing employ large repositories of ordered trees. XML, a standard ordered tree model, and XPath, its associated language, are natural...