✦ LIBER ✦

Efficient algorithms for processing XPath queries

✍ Scribed by Gottlob, Georg; Koch, Christoph; Pichler, Reinhard

Book ID: 121460094
Publisher: Association for Computing Machinery
Year: 2005
Tongue: English
Weight: 705 KB
Volume: 30
Category: Article
ISSN: 0362-5915
DOI: 10.1145/1071610.1071614

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient algorithms for processing XPat

Efficient algorithms for processing XPath queries

✍ Gottlob, Georg; Koch, Christoph; Pichler, Reinhard 📂 Article 📅 2005 🏛 Association for Computing Machinery 🌐 English ⚖ 705 KB

Our experimental analysis of several popular XPath processors reveals a striking fact: Query evaluation in each of the systems requires time exponential in the size of queries in the worst case. We show that XPath can be processed much more efficiently, and propose main-memory algorithms for this pr

XCube: Processing XPath queries in a hyp

XCube: Processing XPath queries in a hypercube overlay network

✍ Yingguang Li; M. Tamer Özsu; Kian-Lee Tan 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 667 KB

XPath Query Processing in a Functional-L

XPath Query Processing in a Functional-Logic Language

✍ J.M. Almendros-Jiménez; R. Caballero; Y. García-Ruiz; F. Sáenz-Pérez 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 383 KB

Efficient processing of top-k queries: s

Efficient processing of top-k queries: selective NRA algorithms

✍ Jing Yuan, Guangzhong Sun, Tao Luo, Defu Lian, Guoliang Chen 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 545 KB

Efficient algorithms for descendant-only

Efficient algorithms for descendant-only tree pattern queries

✍ Michaela Götz; Christoph Koch; Wim Martens 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 619 KB

Efficient algorithms for answering queri

Efficient algorithms for answering queries with unsorted multilists

✍ Billy G. Claybrook; Chung-Shu Yang 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 483 KB