Sciweavers

303 search results - page 34 / 61
» Using a compact tree to index and query XML data
Sort
View
CPM
2006
Springer
125views Combinatorics» more  CPM 2006»
13 years 11 months ago
Geometric Suffix Tree: A New Index Structure for Protein 3-D Structures
Abstract. Protein structure analysis is one of the most important research issues in the post-genomic era, and faster and more accurate query data structures for such 3-D structure...
Tetsuo Shibuya
WWW
2007
ACM
14 years 8 months ago
Using d-gap patterns for index compression
Sequential patterns of d-gaps exist pervasively in inverted lists of Web document collection indices due to the cluster property. In this paper the information of d-gap sequential...
Jinlin Chen, Terry Cook
ICDE
2007
IEEE
122views Database» more  ICDE 2007»
14 years 9 months ago
Put a Tree Pattern in Your Algebra
To address the needs of data intensive XML applications, a number of efficient tree pattern algorithms have been proposed. Still, most XQuery compilers do not support those algori...
George A. Mihaila, Jérôme Simé...
MMDB
2004
ACM
151views Multimedia» more  MMDB 2004»
14 years 29 days ago
Indexing of variable length multi-attribute motion data
Haptic data such as 3D motion capture data and sign language animation data are new forms of multimedia data. The motion data is multi-attribute, and indexing of multiattribute da...
Chuanjun Li, Gaurav N. Pradhan, Si-Qing Zheng, B. ...
CIKM
2010
Springer
13 years 6 months ago
Improved index compression techniques for versioned document collections
Current Information Retrieval systems use inverted index structures for efficient query processing. Due to the extremely large size of many data sets, these index structures are u...
Jinru He, Junyuan Zeng, Torsten Suel