12,957 Hits in 7.3 sec

Efficient evaluation of generalized path pattern queries on XML data

Xiaoying Wu, Stefanos Souldatos, Dimitri Theodoratos, Theodore Dalamagas, Timos Sellis
2008 Proceeding of the 17th international conference on World Wide Web - WWW '08  
In this paper, we focus on the efficient evaluation of partial path queries, a generalization of path pattern queries.  ...  The first one exploits a structural summary of data to generate a set of path-patterns that together are equivalent to a partial path query.  ...  Partial path queries generalize path-pattern queries and are useful for integrating XML data sources with different structures and for querying XML documents when the structure is not fully known to the  ... 
doi:10.1145/1367497.1367610 dblp:conf/www/WuSTDS08 fatcat:c656jku4rngbtb45mel6bxmqk4

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  
model that directs the flow of messages from senders to receivers based on receivers' data interests.  ...  In this model, publishers (i.e., senders) generate messages without knowing their receivers; subscribers (who are potential receivers) express their data interests, and are subsequently notified of the  ...  ., 2002] aggregate tree pattern subscriptions into a smaller set of generalized tree patterns such that (1) a given space constraint on the total size of the subscriptions is met, and (2) the loss in  ... 
doi:10.1007/978-0-387-39940-9_785 fatcat:c6k3eh2dbzghnbpkmgrtefk3vu

Efficient Evaluation of Generalized Tree-Pattern Queries with Same-Path Constraints [chapter]

Xiaoying Wu, Dimitri Theodoratos, Stefanos Souldatos, Theodore Dalamagas, Timos Sellis
2009 Lecture Notes in Computer Science  
We have addressed the problem of efficient 21 We have addressed the problem of efficient non-main-memory evaluation PTPQs on the XML inverted lists evaluation model.  ...  XML Query Evaluation Model XML Inverted Lists Model The data is indexed and the position of every node in the XML document tree is encoded. An inverted list is built on every node label.  ... 
doi:10.1007/978-3-642-02279-1_27 fatcat:6zt7mjrkxjcgdav4lth34ae5z4

Approximate Query Answering and Result Refinement on XML Data [chapter]

Katja Seidler, Eric Peukert, Gregor Hackenbroich, Wolfgang Lehner
2010 Lecture Notes in Computer Science  
Today, many economic decisions are based on the fast analysis of XML data. Yet, the time to process analytical XML queries is typically high.  ...  Although current XML techniques focus on the optimization of query processing, none of these support early approximate feedback as possible in relational Online Aggregation systems.  ...  We have been faced with the following main challenges: Query processing on XML data is heavily dominated by the evaluation of so called twig patterns.  ... 
doi:10.1007/978-3-642-13818-8_7 fatcat:5wmxeco7l5eizo46nyoedcavxy

Evaluation of partial path queries on xml data

Stefanos Souldatos, Xiaoying Wu, Dimitri Theodoratos, Theodore Dalamagas, Timos Sellis
2007 Proceedings of the sixteenth ACM conference on Conference on information and knowledge management - CIKM '07  
In this paper, we define a partial path-pattern query language, and we address the problem of its efficient evaluation on XML data.  ...  These algorithms focus mainly on the evaluation of path-pattern or tree-pattern queries.  ...  In these papers, partial tree-pattern queries are evaluated by generating a set of complete tree-pattern queries based on index graphs (structural summaries of data).  ... 
doi:10.1145/1321440.1321446 dblp:conf/cikm/SouldatosWTDS07 fatcat:72xi4qywqvghlct2hvktowt36e

XML-based RDF data management for efficient query processing

Mo Zhou, Yuqing Wu
2010 Procceedings of the 13th International Workshop on the Web and Databases - WebDB '10  
To harvest such search power requires robust and scalable data repositories that can store RDF data and support efficient evaluation of SPARQL queries.  ...  We propose to decompose RDF graph into a forest of XML trees, store them in an XML repository and rewrite SPARQL queries into XPath/X-Query queries to be evaluated in the XML repository.  ...  evaluation time of the same query on data of various sizes.  ... 
doi:10.1145/1859127.1859132 dblp:conf/webdb/ZhouW10 fatcat:jagibztsx5ch5nq5x36kbtutty

XQUERY : Efficient searching and indexing Algorithm Based on Multi- tries

Anagha Vaidya, Arpita Gopal
2011 International Journal of Database Management Systems  
Their primary focus is on design of query languages for storage effectively. This data-oriented paradigm has taken more efforts in query evaluation.  ...  The unique storage address is generated for each node and it is indexed on path name..  ...  method focus on storage space efficiently and store path information as structure summary , next generation index technique compress XML tree .  ... 
doi:10.5121/ijdms.2011.3314 fatcat:k3t3iml4zzcgvfcoxde4a7z2gu

Efficiently Querying Large XML Data Repositories: A Survey

Gang Gou, Rada Chirkova
2007 IEEE Transactions on Knowledge and Data Engineering  
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.  ...  There has been a growing need for developing high-performance techniques to query large XML data repositories efficiently.  ...  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

Index Structures for Matching XML Twigs Using Relational Query Processors

Zhiyuan Chen, J. Gehrke, F. Korn, N. Koudas, J. Shanmugasundaram, D. Srivastava
2005 21st International Conference on Data Engineering Workshops (ICDEW'05)  
Various index structures have been proposed to speed up the evaluation of XML path expressions.  ...  However, existing XML path indices suffer from at least one of three limitations: they focus only on indexing the structure (relying on a separate index for node content), they are useful only for simple  ...  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.1109/icde.2005.231 dblp:conf/icde/ChenGK05a fatcat:bbvornl7oza6nll3raklpe7x7i

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  
Various index structures have been proposed to speed up the evaluation of XML path expressions.  ...  However, existing XML path indices suffer from at least one of three limitations: they focus only on indexing the structure (relying on a separate index for node content), they are useful only for simple  ...  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

A survey on XML streaming evaluation techniques

Xiaoying Wu, Dimitri Theodoratos
2012 The VLDB journal  
Because of these developments, the querying and efficient processing of XML streams has became a central issue. In this study, we survey the state of the art in XML streaming evaluation techniques.  ...  We focus on both the streaming evaluation of XPath expressions and of XQuery queries.  ...  Algorithm PathStack [21] was designed to evaluate path queries on preprocessed XML data.  ... 
doi:10.1007/s00778-012-0281-y fatcat:snwe5pqhy5eptnfcjmhqfz7am4

XML-based Components for Federating Multiple Heterogeneous Data Sources [chapter]

Georges Gardarin, Fei Sha, Tram Dang Ngoc
1999 Lecture Notes in Computer Science  
The results demonstrate the ability of XML with an associated query language (we use XML-QL) to federate various data sources on the Internet or on Intranets.  ...  The system is composed of four main components: a wrapper generator using rule-based scripting to produce XML data from various source formats, a mediator querying and integrating relational and XML sources  ...  Acknowledgments We would like to thank Peter Fankhauser, Dana Florescu, Henri Laude and Patrick Valduriez for helpful discussions, particularly in the context of the MIRO-Web project.  ... 
doi:10.1007/3-540-47866-3_34 fatcat:jalsfvarnzaxfj2atkxeewuvnu


Hua-Gang Li, S. Alireza Aghili, Divyakant Agrawal, Amr El Abbadi
2006 Proceedings of the 15th international conference on World Wide Web - WWW '06  
An XML range query may impose predicates on the numerical or textual contents of the elements and/or their respective path structures.  ...  The results of our extensive experimental evaluations indicated the efficiency of the proposed system.  ...  Queries on such ordered trees generally impose predicates on the textual content of ELEMENT (keyword search) and/or their corresponding structural relationships (structure pattern search).  ... 
doi:10.1145/1135777.1136025 dblp:conf/www/LiAAA06 fatcat:6alubwtu6veoji2tl33lwbkthu

System RX

Kevin Beyer, Normen Seemann, Tuong Truong, Bert Van der Linden, Brian Vickery, Chun Zhang, Roberta J. Cochrane, Vanja Josifovski, Jim Kleewein, George Lapis, Guy Lohman, Bob Lyle (+2 others)
2005 Proceedings of the 2005 ACM SIGMOD international conference on Management of data - SIGMOD '05  
The new support for XML includes native support for storage and indexing as well as query compilation and evaluation support for the latest industry-standard query languages, SQL/XML and XQuery.  ...  We believe that such a system is fundamental in the evolution of enterprise data management solutions: XML and relational data will co-exist and complement each other in enterprise solutions.  ...  On the other side of the spectrum is the coarse-grained approach, where many binding path expressions are represented in a pattern tree, such as generalized tree patterns [7] .  ... 
doi:10.1145/1066157.1066197 dblp:conf/sigmod/OzcanCPKBJZ05 fatcat:zdaqtbw4dbaxpifxh36weluawa

On Distributing XML Repositories

Jan-Marco Bremer, Michael Gertz
2003 International Workshop on the Web and Databases  
The index structures encode global path information and provide for an efficient, local evaluation of the most common types of global queries.  ...  We also discuss an efficient realization based on small, local index structures.  ...  Queries consist of path and tree patterns to be matched against the distributed source. Path and tree pattern queries build the core of most XML query languages.  ... 
dblp:conf/webdb/BremerG03 fatcat:tvgdls5hkjfmrndecti522wqnm
« Previous Showing results 1 — 15 out of 12,957 results