Sciweavers

303 search results - page 8 / 61
» Using a compact tree to index and query XML data
Sort
View
WWW
2007
ACM
14 years 8 months ago
Querying and maintaining a compact XML storage
As XML database sizes grow, the amount of space used for storing the data and auxiliary data structures becomes a major factor in query and update performance. This paper presents...
Raymond K. Wong, Franky Lam, William M. Shui
DOCENG
2003
ACM
14 years 22 days ago
XPath on left and right sides of rules: toward compact XML tree rewriting through node patterns
XPath [3, 5] is a powerful and quite successful language able to perform complex node selection in trees through compact specifications. As such, it plays a growing role in many ...
Jean-Yves Vion-Dury
ICDE
2007
IEEE
190views Database» more  ICDE 2007»
13 years 11 months ago
CPS-tree: A Compact Partitioned Suffix Tree for Disk-based Indexing on Large Genome Sequences
Suffix tree is an important data structure for indexing a long sequence (like a genome sequence) or a concatenation of sequences. It finds many applications in practice, especiall...
Swee-Seong Wong, Wing-Kin Sung, Limsoon Wong
VLDB
2005
ACM
132views Database» more  VLDB 2005»
14 years 29 days ago
MIX: A Meta-data Indexing System for XML
We present a system for efficient meta-data indexed querying of XML documents. Given the diversity of the information available in XML, it is very useful to annotate XML data wit...
SungRan Cho, Nick Koudas, Divesh Srivastava
BDA
2004
13 years 9 months ago
Indexing XML Objects with Ordered Schema Trees
: XML DBMSs require new indexing techniques to efficiently process structural search and full-text search as integrated in XQuery. Much research has been done for indexing XML docu...
Laurent Yeh, Georges Gardarin