Sciweavers

599 search results - page 4 / 120
» Improving the Efficiency of XPath Execution on Relational Sy...
Sort
View
GEOINFO
2003
13 years 9 months ago
Efficient Query Processing on the Relational Quadtree
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...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
ICDE
2010
IEEE
288views Database» more  ICDE 2010»
14 years 7 months ago
Fast In-Memory XPath Search using Compressed Indexes
A large fraction of an XML document typically consists of text data. The XPath query language allows text search via the equal, contains, and starts-with predicates. Such predicate...
Diego Arroyuelo, Francisco Claude, Sebastian Manet...
SIGMOD
2002
ACM
196views Database» more  SIGMOD 2002»
14 years 7 months ago
Storing and querying ordered XML using a relational database system
XML is quickly becoming the de facto standard for data exchange over the Internet. This is creating a new set of data management requirements involving XML, such as the need to st...
Igor Tatarinov, Stratis Viglas, Kevin S. Beyer, Ja...
BTW
2003
Springer
103views Database» more  BTW 2003»
14 years 28 days ago
XPath-Aware Chunking of XML-Documents
Dissemination systems are used to route information received from many publishers individually to multiple subscribers. The core of a dissemination system consists of an efficient...
Wolfgang Lehner, Florian Irmert
WWW
2007
ACM
14 years 8 months ago
Exploit sequencing views in semantic cache to accelerate xpath query evaluation
In XML databases, materializing queries and their results into views in a semantic cache can improve the performance of query evaluation by reducing computational complexity and I...
Jianhua Feng, Na Ta, Yong Zhang, Guoliang Li