XML-to-SQL query translation literature: The state of the art and open problems

R Krishnamurthy, R Kaushik, JF Naughton - Database and XML …, 2003 - Springer
Recently, the database research literature has seen an explosion of publications with the
goal of using an RDBMS to store and/or query XML data. The problems addressed and …

Holistic twig joins on indexed XML documents

H Jiang, W Wang, H Lu, JX Yu - Proceedings 2003 VLDB Conference, 2003 - Elsevier
Publisher Summary XML is emerging as a de facto standard for information exchange over
the Internet. Although XML documents could have rather complex internal structures, they …

Efficiently querying large XML data repositories: A survey

G Gou, R Chirkova - IEEE Transactions on Knowledge and …, 2007 - ieeexplore.ieee.org
Extensible markup language (XML) is emerging as a de facto standard for information
exchange among various applications on the World Wide Web. There has been a growing …

PRIX: Indexing and querying XML using prufer sequences

P Rao, B Moon - Proceedings. 20th International Conference …, 2004 - ieeexplore.ieee.org
We propose a new way of indexing XML documents and processing twig patterns in an XML
database. Every XML document in the database can be transformed into a sequence of …

[PDF][PDF] Stack-based algorithms for pattern matching on dags

L Chen, A Gupta, ME Kurul - … of the 31st international conference on Very …, 2005 - Citeseer
Existing work for query processing over graph data models often relies on pre-computing the
transitive closure or path indexes. In this paper, we propose a family of stack-based …

Indexing dataspaces

X Dong, A Halevy - proceedings of the 2007 ACM SIGMOD international …, 2007 - dl.acm.org
Dataspaces are collections of heterogeneous and partially unstructured data. Unlike data-
integration systems that also offer uniform access to heterogeneous data sources …

On the integration of structure indexes and inverted lists

R Kaushik, R Krishnamurthy, JF Naughton… - Proceedings of the …, 2004 - dl.acm.org
Several methods have been proposed to evaluate queries over a native XML DBMS, where
the queries specify both path and keyword constraints. These broadly consist of graph …

Efficient processing of XML twig patterns with parent child edges: a look-ahead approach

J Lu, T Chen, TW Ling - Proceedings of the thirteenth ACM international …, 2004 - dl.acm.org
With the growing importance of semi-structure data in information exchange, much research
has been done to provide an effective mechanism to match a twig query in an XML …

Staircase join: Teach a relational DBMS to watch its (axis) steps

T Grust, M Van Keulen, J Teubner - Proceedings 2003 VLDB Conference, 2003 - Elsevier
Publisher Summary Relational query processors derive much of their effectiveness from the
awareness of specific table properties like sort order, size, or absence of duplicate tuples …

TwigList: Make Twig Pattern Matching Fast

L Qin, JX Yu, B Ding - International Conference on Database Systems for …, 2007 - Springer
Twig pattern matching problem has been widely studied in recent years. Give an xml tree T.
A twig-pattern matching query, Q, represented as a query tree, is to find all the occurrences …