Abstract
Inspired by the best querying performance of ViST among the rest of the approaches in the literature, and meanwhile to overcome its shortcomings, in this paper, we present another efficient and novel geometric sequence mechanism, which transforms XML documents and XPath queries into the corresponding geometric data/query sequences. XML querying is thus converted to finding non-contiguous geometric subsequence matches. Our approach ensures correct (i.e., without semantic false) and fast (i.e., without the costly post-processing phase) evaluation of XPath queries, while at the same time guaranteeing the linear space complexity. We demonstrate the significant performance improvement of our approach through a set of experiments on both synthetic and real-life data.
| Original language | English |
|---|---|
| Title of host publication | Advances in Databases and Information Systems |
| Subtitle of host publication | 9th East European Conference, ADBIS 2005, Tallinn, Estonia, September 12-15, 2005 |
| Place of Publication | Berlin, Germany |
| Publisher | Springer |
| Pages | 223-237 |
| Number of pages | 15 |
| ISBN (Print) | 978-3-540-28585-4 |
| DOIs | |
| Publication status | Published - Sept 2005 |
| Event | 9th East European Conference on Advances in Databases and Information Systems, ADBIS 2005 - Tallinn, Estonia Duration: 12 Sept 2005 → 15 Sept 2005 Conference number: 9 |
Publication series
| Name | Lecture Notes in Computer Science |
|---|---|
| Publisher | Springer |
| Volume | 3631 |
| ISSN (Print) | 0302-9743 |
Conference
| Conference | 9th East European Conference on Advances in Databases and Information Systems, ADBIS 2005 |
|---|---|
| Abbreviated title | ADBIS |
| Country/Territory | Estonia |
| City | Tallinn |
| Period | 12/09/05 → 15/09/05 |
Keywords
- EWI-7675
- METIS-229541
- IR-63612
- DB-XMLDB: XML DATABASES