R. Kaushik, J. F. Naughton, P. Bohannon, and H. F. Korth. Covering indexes for branching path queries. In ACM SIGMOD 2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Recent Progress on Selected Topics in Database Research - Chen, Li, al. (Correct)
....rendering these theoretical solutions to be outperformed by the practical solutions introduced earlier. 5 Indexing XML by Tree Structures With the growing importance of XML in data exchange, much research has been done in providing flexible query mechanisms to extract data from XML documents [69, 72, 71, 68, 67, 70]. We propose a novel index structure that addresses a wide range of challenges in indexing semi structured data [73] Unlike state of the art approaches that disassemble a structured query into multiple sub queries, and then join the results of these sub queries to provide the final answers, our ....
R. Kaushik, P. Bohannon, J. Naughton, and H. Korth. Covering indexes for branching path queries. In ACM SIGMOD, June 2002.
ViST: A Dynamic Index Method for Querying XML Data by Tree.. - Wang, Park, Fan, Yu (2003) (10 citations) (Correct)
....using any specialized data structures that are not well supported by DBMSs. Our experiments show that ViST is e#ective, scalable, and e#cient in supporting structural queries. 1. INTRODUCTION much research has been done in providing flexible query mechanisms to extract data from XML documents [11, 18, 16, 9, 6, 14]. The semi structured nature of XML data and the requirements on query flexibility pose unique challenges to database indexing methods. In this paper, we introduce a novel index structure, ViST , which provides solutions to a wide range of challenges, and o#ers better performance and usability ....
....reason, these methods are also ine#cient in handling or queries (Q3 and Q4 , for instance) which too, correspond to multiple paths. To avoid expensive join operations, some index methods create special index entries for frequently occurring multiple path queries (known as refined paths) [9, 14]. The potential disadvantages of this approach include i) we need to monitor query patterns, ii) it is not a general approach since not every branching query is optimized, and iii) the number of refined paths can have a huge impact on the size and the maintenance cost of the index. Moreover, to ....
[Article contains additional citation context not shown here]
R. Kaushik, P. Bohannon, J. Naughton, and H. Korth. Covering indexes for branching path queries. In ACM SIGMOD, June 2002.
On the Integration of Structure Indexes and Inverted.. - Kaushik, Krishnamurthy, .. (2004) (5 citations) Self-citation (Kaushik Naughton) (Correct)
No context found.
R. Kaushik, P. Bohannon, J. Naughton, and H. Korth. Covering indexes for branching path queries. In SIGMOD, 2002.
Updates for Structure Indexes - Kaushik, Bohannon, Naughton, Shenoy (2002) (4 citations) Self-citation (Kaushik Bohannon Naughton) (Correct)
....novel structural indexes [5, 10, 11] have been proposed for semi structured data. Unlike a schema, structure indexes are not prescriptive and thus may change with any update. Generalizations of these structures have gained increasing attention recently, as flexible index structures for XML [6, 15, 16], and size and performance issues in the original proposals have been addressed [16] In addition, the ideas behind these structure indexes have been used as statistical synopses for estimating path expression selectivity [2, 12] Obviously, a significant part of implementing these ideas in ....
....than rebuilding the index. We then discuss how these algorithms extend to three representatives of structure indexes based on bisimilarity as follows. 1 Index [10] This is directly defined from the graph bisimulation partition. It is designed to cover simple path expressions. F B Index [15]: This index is also based on bisimulation, but is extended to work for branching path expressions (e.g. XPath expressions) A(k) index [16] This is based on a variant of the bisimulation concept and addresses size and performance problems with the 1 Index. While our algorithm to add a ....
[Article contains additional citation context not shown here]
R.Kaushik, P.Bohannon, J.F.Naughton, and H.F.Korth. Covering indexes for branching path queries. In Proceedings of SIGMOD, 2002.
XQuery Optimization - Philippe Michiels Ua (Correct)
No context found.
R. Kaushik, J. F. Naughton, P. Bohannon, and H. F. Korth. Covering indexes for branching path queries. In ACM SIGMOD 2002.
Index Structures for Matching XML Twigs Using Relational.. - University Of Maryland (2005) (Correct)
No context found.
R. Kaushik, et al. Covering indexes for branching path queries. In SIGMOD, 2002.
Tree-Pattern Queries on a Lightweight XML Processor - Moro, Vagena, Tsotras (2005) (Correct)
No context found.
R. Kaushik et.al. Covering Indexes for Branching Path Queries. In Proc. of SIGMOD, 2002.
On Boosting Holism in XML Twig Pattern Matching Using.. - Chen, Lu, Ling (2005) (2 citations) (Correct)
No context found.
R. Kaushik, P. Bohannon, J. F. Naughton, and H. F. Korth. Covering indexes for branching path queries. In Proceedings of SIGMOD 2002.
A Framework for Using Materialized XPath Views in - Xml Query Processing (2004) (Correct)
No context found.
R. Kaushik, P. Bohannon, J. F. Naughton, and H. F. Korth. Covering indexes for branching path queries. In Proceedings of SIGMOD, 2002.
An Evaluation of Binary XML Encoding Optimizations .. - Bayardo, Gruhl.. (2004) (Correct)
No context found.
J. F. N. Raghav Kaushik, Philip Bohannon and H. F. Korth. Covering indexes for branching path queries. In SIGMOD 2002.
Indexing Temporal XML Documents - Alberto Mendelzon Department (2004) (Correct)
No context found.
R. Kaushik, P. Bohannon, J.F. Naughton, and H. Korth. Covering indexes for branching path queries. In ACM SIGMOD, pages 133--144, Wisconsin, Madison, 2002.
Twig Query Processing over Graph-Structured XML Data - Zografoula Vagena Computer (2004) (Correct)
No context found.
R. Kaushik, P. Bohannon, J. F. Naughton, and H. F. Korth. Covering indexes for branching path queries. In Proc. of SIGMOD, 2002.
An Evaluation of Binary XML Encoding Optimizations .. - Bayardo, Gruhl.. (2004) (Correct)
No context found.
J. F. N. Raghav Kaushik, Philip Bohannon and H. F. Korth. Covering indexes for branching path queries. In SIGMOD 2002.
A Model For Querying Semistructured Data Through The.. - Of Regular Sub-Structures (2004) (Correct)
No context found.
Kaushik, Bohannon, et al. Covering Indexes for Branching Path Queries, In Proc. of SIGMOD, 2002
An Evaluation of Binary XML Encoding Optimizations .. - Bayardo, Gruhl.. (2004) (Correct)
No context found.
J. F. N. Raghav Kaushik, Philip Bohannon and H. F. Korth. Covering indexes for branching path queries. In SIGMOD 2002.
Covering Indexes for XML Queries: Bisimulation - Simulation =.. - Ramanan (2003) (Correct)
No context found.
R. Kaushik, P. Bohannon, J. F. Naughton and H. F. Korth. Covering Indexes for Branching Path Queries, Proc. ACM SIGMOD Intl. Conf. Management of Data, 2002, pp. 133--144.
XQuery Optimization - Michiels (Correct)
No context found.
R. Kaushik, J. F. Naughton, P. Bohannon, and H. F. Korth. Covering indexes for branching path queries. In ACM SIGMOD 2002.
Projecting XML Documents - Marian, Simeon (2003) (9 citations) (Correct)
No context found.
R. Kaushik, P. Bohannon, J. F. Naughton, and H. F. Korth. Covering indexes for branching path queries. In Proceedings of ACM Conference on Management of Data (SIGMOD), 2002.
PRIX: Indexing And Querying XML Using Prufer Sequences - Rao, Moon (2003) (4 citations) (Correct)
No context found.
R. Kaushik, P. Bohannon, J. F. Naughton, and H. F. Korth. Covering indexes for branching path queries. In Proceedings of the 2002.
Projecting XML Documents - Amelie Marian Columbia (2003) (9 citations) (Correct)
No context found.
R. Kaushik, P. Bohannon, J. F. Naughton, and H. F. Korth. Covering indexes for branching path queries. In Proceedings of ACM Conference on Management of Data (SIGMOD), 2002.
On the Sequencing of Tree Structures for XML Indexing - Wang (2003) (1 citation) (Correct)
No context found.
R. Kaushik, P. Bohannon, J. Naughton, and H. Korth. Covering indexes for branching path queries. In ACM SIGMOD, June 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC