Sciweavers

303 search results - page 5 / 61
» Using a compact tree to index and query XML data
Sort
View
DEXA
2005
Springer
138views Database» more  DEXA 2005»
14 years 1 months ago
Full-Text and Structural XML Indexing on B+-Tree
XML query processing is one of the most active areas of database research. Although the main focus of past research has been the processing of structural XML queries, there are gro...
Toshiyuki Shimizu, Masatoshi Yoshikawa
BNCOD
2009
145views Database» more  BNCOD 2009»
13 years 8 months ago
Compacting XML Structures Using a Dynamic Labeling Scheme
Due to the growing popularity of XML as a data exchange and storage format, the need to develop efficient techniques for storing and querying XML documents has emerged. A common ap...
Ramez Alkhatib, Marc H. Scholl
VLDB
2007
ACM
145views Database» more  VLDB 2007»
14 years 7 months ago
LCS-TRIM: Dynamic Programming Meets XML Indexing and Querying
In this article, we propose a new approach for querying and indexing a database of trees with specific applications to XML datasets. Our approach relies on representing both the q...
Shirish Tatikonda, Srinivasan Parthasarathy, Matth...
WEBDB
2005
Springer
101views Database» more  WEBDB 2005»
14 years 28 days ago
T-SIX: An Indexing System for XML Siblings
We present a system for efficient indexed querying of XML documents, enhanced with sibling operations. R-tree index proposed in [5] has a very high cost for the following-sibling...
SungRan Cho
WWW
2006
ACM
14 years 8 months ago
Compressing and searching XML data via two zips
XML is fast becoming the standard format to store, exchange and publish over the web, and is getting embedded in applications. Two challenges in handling XML are its size (the XML...
Paolo Ferragina, Fabrizio Luccio, Giovanni Manzini...