Sciweavers

65 search results - page 2 / 13
» Ctree: a compact tree for indexing XML data
Sort
View
APWEB
2004
Springer
13 years 10 months ago
Labeling and Querying Dynamic XML Trees
Abstract With the growing importance of XML in data exchange, much research tends to provide a compact labeling scheme and a flexible query facility to extract data from dynamic XM...
Jiaheng Lu, Tok Wang Ling
SIGMOD
2003
ACM
174views Database» more  SIGMOD 2003»
14 years 4 months ago
ViST: A Dynamic Index Method for Querying XML Data by Tree Structures
With the growing importance of XML in data exchange, much research has been done in providing flexible query facilities to extract data from structured XML documents. In this pape...
Haixun Wang, Sanghyun Park, Wei Fan, Philip S. Yu
GVD
2009
128views Database» more  GVD 2009»
13 years 2 months ago
A Self-Adaptive Insert Strategy for Content-Based Multidimensional Database Storage
In this paper, we present the current development progress of our dynamic insert strategy based on the Intelligent Cluster Index (ICIx), which is a new type of multidimensional da...
Sebastian Leuoth, Wolfgang Benn
CIKM
2005
Springer
13 years 10 months ago
Compact reachability labeling for graph-structured data
Testing reachability between nodes in a graph is a well-known problem with many important applications, including knowledge representation, program analysis, and more recently, bi...
Hao He, Haixun Wang, Jun Yang 0001, Philip S. Yu
ICDE
2007
IEEE
190views Database» more  ICDE 2007»
13 years 8 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