Filters








447 Hits in 8.0 sec

Efficiently Querying Large XML Data Repositories: A Survey

Gang Gou, Rada Chirkova
2007 IEEE Transactions on Knowledge and Data Engineering  
There has been a growing need for developing high-performance techniques to query large XML data repositories efficiently.  ...  One important problem in XML query processing is twig pattern matching, that is, finding in an XML data tree D all matches that satisfy a specified twig (or path) query pattern Q.  ...  ACKNOWLEDGMENTS The authors are grateful to Jun Yang and to the anonymous reviewers for their valuable comments and suggestions on earlier drafts of this survey.  ... 
doi:10.1109/tkde.2007.1060 fatcat:kzmwqcla6rfyvakf4ctc5dwlwm

A Prime Number Approach to Matching an XML Twig Pattern including Parent-Child Edges

Shtwai Alsubai, Siobhán North
2017 Proceedings of the 13th International Conference on Web Information Systems and Technologies  
Twig pattern matching is a core operation in XML query processing because it is how all the occurrences of a twig pattern in an XML document are found.  ...  To reduce the memory consumption and computation overhead of twig pattern matching algorithms when Parent-Child (P-C) edges are involved, TwigStackPrime efficiently filters out a tremendous number of irrelevant  ...  The XML structured queries for evaluation over these dataset were chosen specifically because it is not common for queries, which contain both '//' and '/', to have a significant difference in performance  ... 
doi:10.5220/0006225602040211 dblp:conf/webist/AlsubaiN17 fatcat:2dnfqdkhy5gktor7qcyr4fphrm

Efficient evaluation of high-selective xml twig patterns with parent child edges in tree-unaware rdbms

Sourav S. Bhowmick, Erwin Leonardi, Hongmei Sun
2007 Proceedings of the sixteenth ACM conference on Conference on information and knowledge management - CIKM '07  
Our scheme is built on top of our SUCXENT++ system. We show that by exploiting the encoding scheme of SUCXENT++, we can devise efficient strategy for evaluating such twig queries.  ...  Extensive performance studies on various data sets and queries show that our approach performs better than a representative tree-unaware approach (GLOBAL-ORDER) and a state-of-the-art native twig join  ...  We appreciate the effort of the PICASSO team for efficiently resolving several implementation issues related to PICASSO.  ... 
doi:10.1145/1321440.1321534 dblp:conf/cikm/BhowmickLS07 fatcat:lxarqaq4kzctbf6v3bxvegm7r4

Semantic-based Structural and Content indexing for the efficient retrieval of queries over large XML data repositories

Norah Saleh Alghamdi, Wenny Rahayu, Eric Pardede
2014 Future generations computer systems  
Our method particularly addresses a twig XML query (or a branched path query), as it is one of the most costly query tasks due to the complexity of the join operation between multiple paths.  ...  In particular, we focus on XML twig queries with or without value predicates. A twig query is a type of query which accesses XML trees with multiple branches and http://dx.  ...  Acknowledgment The first author would like to express her gratitude to the Taif University in Saudi Arabia, for supporting her with a scholarship.  ... 
doi:10.1016/j.future.2014.02.010 fatcat:liwz6tqt4bfbbjrawrazwbb2zu

Relational universal index structure for evaluating XML twig queries

Samir Mohammad, Patrick Martin, Wendy Powley
2011 2011 International Conference on Communications and Information Technology (ICCIT)  
Extensible Markup Language (XML) is a de facto standard for data exchange in the World Wide Web. Indexing plays a key role in improving the execution of XML queries over that data.  ...  required to evaluate twig queries, and also to facilitate effective query optimization through early pruning of the space search.  ...  Our proposed approach has a compact size, yet, it supports efficient evaluations of twig queries. It uses a RDBMS to store and query XML documents.  ... 
doi:10.1109/iccitechnol.2011.5762659 fatcat:t44shh63rbdybeudfkjkbbwwd4

TwigX-Guide: Twig Query Pattern Matching for XML Trees

Su-Cheng Haw, Chien-Sing Lee
2008 American Journal of Applied Sciences  
The growing importance of XML and the lack of efficient solutions for managing and querying XML data have led to the development of hybrid systems.  ...  With TwigX-Guide, a complex query can be decomposed into a set of path queries, which are evaluated individually by retrieving the path or node matches from the DataGuide index table and subsequently joining  ...  INTRODUCTION With the rapid emergence of XML as an enabler for data exchange and data transfer over the Web, querying XML data has become a major concern.  ... 
doi:10.3844/ajassp.2008.1212.1218 fatcat:ry4q4umhkzberm63qbzt56orta

Efficient Processing of Ordered XML Twig Pattern [chapter]

Jiaheng Lu, Tok Wang Ling, Tian Yu, Changqing Li, Wei Ni
2005 Lecture Notes in Computer Science  
Finding all the occurrences of a twig pattern in an XML database is a core operation for efficient evaluation of XML queries.  ...  Holistic twig join algorithm has showed its superiority over binary decompose based approach due to efficient reducing intermediate results.  ...  Introduction With the rapidly increasing popularity of XML for data representation, there is a lot of interest in query processing over data that conforms to a tree-structured data model( [1] , [5] )  ... 
doi:10.1007/11546924_30 fatcat:nwtomycnrvbx5nzugwht7zhj2a

TwigStackPrime: A Novel Twig Join Algorithm Based on Prime Numbers [chapter]

Shtwai Alsubai, Siobhán North
2018 Lecture Notes in Business Information Processing  
A labelling scheme is fundamental to processing XML queries efficiently.  ...  The growing number of XML documents leads to the need for appropriate XML querying algorithms which are able to utilize the specific characteristics of XML documents.  ...  Improving the efficiency of tree patterns matching is a core operation in processing of an XML query [2, 10, 9, 17, 4] since tree patterns are the basis for querying structured tree-based data model  ... 
doi:10.1007/978-3-319-93527-0_1 fatcat:dgilt5ba3rgffifqppkbqoky5a

XML Publish/Subscribe [chapter]

Michael Rys, Dongwon Lee, Ting Yu, Michael Rys, Denilson Barbosa, Ioana Manolescu, Jeffrey Xu Yu, Jayant R. Haritsa, Dan Suciu, Michael Rys, Michael Rys, Xin Luna Dong (+45 others)
2009 Encyclopedia of Database Systems  
XML publish/subscribe is a publish/subscribe model in which messages are encoded in XML and subscriptions are written in an XML query language such as a subset of XQuery 1.0. 1 In XML-based pub/sub systems  ...  model that directs the flow of messages from senders to receivers based on receivers' data interests.  ...  In XML-based pub/sub systems, XML data continuously arrives from external sources, and user subscriptions, stored as continuous queries in a message broker, are evaluated every time when a new data item  ... 
doi:10.1007/978-0-387-39940-9_785 fatcat:c6k3eh2dbzghnbpkmgrtefk3vu

Experimental Evaluation of Query Processing Techniques over Multiversion XML Documents

Adam Woss, Vassilis J. Tsotras
2009 International Workshop on the Web and Databases  
Such methods would allow the user to efficiently perform structural queries over any past version or interval of versions of the XML document.  ...  Various approaches have been recently proposed for storing the evolution of an XML document, thereby preserving useful past information about the document and thus the ability to query it.  ...  of partial version retrieval queries. [19] addresses path expression queries on a multiversion XML document using a region-based numbering scheme.  ... 
dblp:conf/webdb/WossT09 fatcat:aatbbkwpancs5cm7vkvv2xtxui

TwigINLAB: A Decomposition-Matching-Merging Approach To Improving XML Query Processing

Su-Cheng Haw, Chien-Sing Lee
2008 American Journal of Applied Sciences  
The emergence of the Web has increased significant interests in querying XML data.  ...  Current methods for XML query processing still suffers from producing large intermediate results and are not efficient in supporting query with mixed types of relationships.  ...  ACKNOWLEDGEMENTS This work was partially supported by funding from eScienceFund, Ministry of Science, Technology and Innovation, Malaysia.  ... 
doi:10.3844/ajassp.2008.1199.1205 fatcat:ikvhxuxdhbfepdcqq7rqttq7ii

Massively parallel XML twig filtering using dynamic programming on FPGAs

Roger Moussalli, Mariam Salloum, Walid Najjar, Vassilis J. Tsotras
2011 2011 IEEE 27th International Conference on Data Engineering  
This paper, presents a novel method for performing unordered holistic twig matching on FPGAs without any false positives, and whose throughput is independent of the complexity of the user queries or the  ...  Furthermore, we present experimental comparison of different granularities of twig matching, namely path-based (root-to-leaf) and pair-based (parent-child or ancestor-descendant).  ...  Furthermore, we presented a comparison of our holistic FPGA-based approach against path-based and pair-based approaches, which break twigs into root-to-leaf paths and parentchild/ancestor-descendant pairs  ... 
doi:10.1109/icde.2011.5767899 dblp:conf/icde/MoussalliSNT11 fatcat:5zzgcorgrreedaejhrnuz6qgxy

A survey on tree matching and XML retrieval

Mohammed Amin Tahraoui, Karen Pinel-Sauvagnat, Cyril Laitang, Mohand Boughanem, Hamamache Kheddouci, Lei Ning
2013 Computer Science Review  
Although retrieving XML documents can be considered as a tree matching problem between the query tree and the document trees, only a few approaches take advantage of the algorithms and methods proposed  ...  In this paper, we aim at studying the theoretical approaches proposed in the literature for tree matching and at seeing how these approaches have been adapted to XML querying and retrieval, from both an  ...  The efficiency track The aim of the efficiency track (launched in 2008 and 2009) was to evaluate the effectiveness and efficiency of XML ranked retrieval approaches on real data and real queries [134]  ... 
doi:10.1016/j.cosrev.2013.02.001 fatcat:6xnbgq4txvgxtnw35myadfmtkm

Efficient Evaluation of NOT-Twig Queries in Tree-Unaware Relational Databases [chapter]

Kheng Hong Soh, Sourav S. Bhowmick
2011 Lecture Notes in Computer Science  
In this paper, we present an efficient strategy to evaluate not-twig queries on top of a dewey-based tree-unaware system called Sucxent++ [11] .  ...  Based on this encoding scheme, we propose a novel sql translation algorithm for not-twig query evaluation.  ...  As Sucxent++ is designed primarily for fast evaluation of normal path and twig queries, it does not support efficient evaluation of nottwig queries.  ... 
doi:10.1007/978-3-642-20149-3_37 fatcat:ra4fb3yhbrfknjzgytjgjcui2e

Index structures for matching XML twigs using relational query processors

Zhiyuan Chen, Johannes Gehrke, Flip Korn, Nick Koudas, Jayavel Shanmugasundaram, Divesh Srivastava
2007 Data & Knowledge Engineering  
The experimental results show that our novel indices achieve orders of magnitude improvement in performance for evaluating twig queries, albeit at a higher space cost, over the use of previously proposed  ...  We also propose two novel index structures in this family, with different space-time tradeoffs, that are effective for the evaluation of XML branching path expressions (i.e., twigs) with value conditions  ...  The focus of this paper is on developing index structures that can support the efficient evaluation of XML ad hoc, recursive, twig queries using a relational database system.  ... 
doi:10.1016/j.datak.2006.03.003 fatcat:wtbf2xcvuffcln725m552hpwya
« Previous Showing results 1 — 15 out of 447 results