Sciweavers

65 search results - page 1 / 13
» Efficient Support for Ordered XPath Processing in Tree-Unawa...
Sort
View
DASFAA
2007
IEEE
205views Database» more  DASFAA 2007»
13 years 9 months ago
Efficient Support for Ordered XPath Processing in Tree-Unaware Commercial Relational Databases
Abstract. In this paper, we present a novel ordered XPATH evaluation in treeunaware RDBMS. The novelties of our approach lies in the followings. (a) We propose a novel XML storage ...
Boon-Siew Seah, Klarinda G. Widjanarko, Sourav S. ...
SIGMOD
2007
ACM
120views Database» more  SIGMOD 2007»
14 years 5 months ago
Xpath on steroids: exploiting relational engines for xpath performance
A lot of research has been conducted by the database community on methods and techniques for efficient XPath processing, with great success. Despite the progress made, significant...
Haris Georgiadis, Vasilis Vassalos
ADBIS
2006
Springer
139views Database» more  ADBIS 2006»
13 years 9 months ago
Xeek: An Efficient Method for Supporting XPath Evaluation with Relational Databases
We introduce Xeek, a method for managing XML documents using relational databases. Most previous proposals in which the XPath axes are evaluated using only the pre- and postorder n...
Olli Luoma
SIGMOD
2002
ACM
196views Database» more  SIGMOD 2002»
14 years 5 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...
SIGMOD
2007
ACM
145views Database» more  SIGMOD 2007»
14 years 5 months ago
Why off-the-shelf RDBMSs are better at XPath than you might expect
To compensate for the inherent impedance mismatch between the relational data model (tables of tuples) and XML (ordered, unranked trees), tree join algorithms have become the prev...
Torsten Grust, Jan Rittinger, Jens Teubner