A Fast Index for Semistructured Data
By Brian F. Cooper, N. Sample, M. Franklin, Gísli R. Hjaltason, Moshe Shadmon. Very Large Data Bases Conference, 2001
407 citations recorded by the source corpus.
View Paper: https://www.semanticscholar.org/paper/2ed7da17c63e5805a14f225943a3b3b2e5938cdb
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
- Jiawei Han
- Charu C. Aggarwal
- Philip S. Yu
- Xifeng Yan
- Mohammed J. Zaki
- Jignesh M. Patel
- Divesh Srivastava
- I. Tatarinov
Citations in the corpus
- Storing and querying ordered XML using a relational database system (2002, methodology): “The issues of updating XML data stored in relations [16] and indexing XML data [3][8][24] have also been studied.”
- Covering indexes for branching path queries (2002, background): “There has been a considerable amount of work on indexing for semi-structured/XML data [4, 6, 7, 9, 11, 12, 17].”
- LSH forest: self-tuning indexes for similarity search (2005, unknown): “There are a slew of disk-based data structures for storing and querying string data (e.g., Prefix B-Trees [2], paginated B-Trees [28], String B-Trees [17], Index Fabric [12]), which can all be used in our context.”
- Exploiting local similarity for indexing paths in graph-structured data (2002, methodology): “In [8], every path in the tree is viewed as a string and stored in a multi-level Patricia trie.”
- Graph indexing: a frequent structure-based approach (2004, background): “Index Fabric [5] represents every path in a tree as a string and stores it in a Patricia trie.”
- Fg-index: towards verification-free query processing on graph databases (2007, methodology): “DataGuides [10], T-index [16], Index Fabric [8], APEX [5], F&B-index [14], and D(k)index [3] are for semi-structured data and XML.”
- APEX: an adaptive path index for XML data (2002, background): “[8] presented the Index Fabric which is conceptually similar to the strong DataGuide in that it keeps all label paths starting from the root element.”
- TIMBER: A native XML database (2002, background): “More recently, novel path indices have been proposed for XML and semi-structured data [15, 28, 37].”