Filters








2,638 Hits in 5.5 sec

Path summaries and path partitioning in modern XML databases

Andrei Arion, Angela Bonifati, Ioana Manolescu, Andrea Pugliese
2006 Proceedings of the 15th international conference on World Wide Web - WWW '06  
We revisit the notions of path summaries and path-driven storage model in the context of current-day XML databases.  ...  XML path summaries are compact structures representing all the simple parent-child paths of an XML document.  ...  Acknowledgements The authors are grateful to Christoph Koch for providing us with his XML compressor code [14] , and to Pierre Senellart for sharing with us his query unfolding application.  ... 
doi:10.1145/1135777.1136023 dblp:conf/www/ArionBMP06 fatcat:veluiuw64rglpbkgxc2rpgyboy

Path Summaries and Path Partitioning in Modern XML Databases

Andrei Arion, Angela Bonifati, Ioana Manolescu, Andrea Pugliese
2007 World wide web (Bussum)  
We revisit the notions of path summaries and path-driven storage model in the context of current-day XML databases.  ...  XML path summaries are compact structures representing all the simple parent-child paths of an XML document.  ...  Acknowledgements The authors are grateful to Christoph Koch for providing us with his XML compressor code [14] , and to Pierre Senellart for sharing with us his query unfolding application.  ... 
doi:10.1007/s11280-007-0036-7 fatcat:ho5cgc7zn5ayzesvomjs3rssry

Path Summaries and Path Partitioning in Modern XML Databases [article]

Andrei Arion, Angela Bonifati, Ioana Manolescu (INRIA Futurs), Andrea Pugliese
2006 arXiv   pre-print
We study the applicability of XML path summaries in the context of current-day XML databases.  ...  We find that summaries provide an excellent basis for optimizing data access methods, which furthermore mixes very well with path-partitioned stores.  ...  Acknowledgements The authors are grateful to Christoph Koch for providing us with his XML compressor code [12] , and to Pierre Senellart for sharing with us his query unfolding application.  ... 
arXiv:cs/0602039v1 fatcat:zh4q7qyfkfcd3loiejop7lqmh4

An Effective Parallel XML Fuzzy Query Processing

K. NareshKumar, N. V. E. S Murthy, Ch. Satyanand Reddy
2014 International Journal of Computer Applications  
Representation and handling of inexactness in information has become the major issues in modern database system and next generation information systems.  ...  This paper presents a query processing model could coupled with fuzzy logic in XML database system.  ...  Figure 4: An XML tree (a) and (b) and their corresponding partition results 3.2(d) P-PATHSTACK: PARALLEL PATH STACK ALGORITHM: In this section, we describe the Parallel PathStack algorithm, which is  ... 
doi:10.5120/15012-3294 fatcat:5rzsbbg4kvdtnma74evg5qwcgu

Why off-the-shelf RDBMSs are better at XPath than you might expect

Torsten Grust, Jan Rittinger, Jens Teubner
2007 Proceedings of the 2007 ACM SIGMOD international conference on Management of data - SIGMOD '07  
XML data in relational databases, most notably the TwigStack [6], structural join [1], and staircase join [13] algorithms.  ...  We carefully exploit existing database functionality and accelerate XPath navigation by purely relational means: partitioned B-trees bring access costs to secondary storage to a minimum, while aggregation  ...  SUMMARY In the interest of efficient XML processing on relational systems, earlier work has proposed a number of novel database operators that provide specialized tree processing support in the database  ... 
doi:10.1145/1247480.1247591 dblp:conf/sigmod/GrustRT07 fatcat:ljkbsvbtxjeunpucyz7cmaxklq

A General Framework for Estimating XML Query Cardinality [chapter]

Carlo Sartiani
2004 Lecture Notes in Computer Science  
summaries for XML data.  ...  Existing estimation models for XML queries focus on particular aspects of XML querying, such as the estimation of path and twig expression cardinality, and they do not deal with the problem of predicting  ...  While path and twig estimation is a peculiar issue of XML and semistructured query languages, predicate and group cardinality estimation are well-known problems in database theory and practice.  ... 
doi:10.1007/978-3-540-24607-7_16 fatcat:aph4vjl6xzantpljlypxuej3tm

Exploring XML web collections with DescribeX

Mariano P. Consens, Renée J. Miller, Flavio Rizzolo, Alejandro A. Vaisman
2010 ACM Transactions on the Web  
To support modern web applications, we introduce DescribeX, a powerful framework that is capable of describing complex XML summaries of web collections.  ...  DescribeX supports the construction of heterogenous summaries that can be declaratively defined and refined by means of axis path regular expression (AxPREs).  ...  A DTD is a context-free grammar and an XML Schema is a typed definition language. Both are schemas in the database sense, and thus describe classes of documents and constrain their structure.  ... 
doi:10.1145/1806916.1806920 fatcat:zbwam6cwtrespdhudcu2pednjm

HOPI: An Efficient Connection Index for Complex XML Document Collections [chapter]

Ralf Schenkel, Anja Theobald, Gerhard Weikum
2004 Lecture Notes in Computer Science  
the ancestor, descendant, and link axes to support path expressions with wildcards in our XXL search engine.  ...  In contrast to most of the prior work on XML indexing we consider not only paths with child or parent relationships between the nodes, but also provide space-and time-efficient reachability tests along  ...  Recent work on path indexing is based on structural summaries of XML graphs. Some approaches represent all paths starting from document roots, e.g., Data Guide [14] and Index Fabric [10] .  ... 
doi:10.1007/978-3-540-24741-8_15 fatcat:jlwivok76bdszhxrifydkal3mq

XCluster Synopses for Structured XML Content

N. Polyzotis, M. Garofalakis
2006 22nd International Conference on Data Engineering (ICDE'06)  
We tackle the difficult problem of summarizing the path/branching structure and value content of an XML database that comprises both numeric and textual values.  ...  In a nutshell, an XCLUSTER synopsis represents an effective clustering of XML elements based on both their structural and value-based characteristics.  ...  types in XML databases.  ... 
doi:10.1109/icde.2006.175 dblp:conf/icde/PolyzotisG06 fatcat:7s7wfykacrcpbnx7pvj3nlimaa

Parallelization of XPath Queries Using Modern XQuery Processors [chapter]

Shigeyuki Sato, Wei Hao, Kiminori Matsuzaki
2018 Communications in Computer and Information Science  
A practical and promising approach to parallelizing XPath queries was proposed by Bordawekar et al. in 2009, which enables parallelization on top of existing XML database engines.  ...  In this work, we implement their approach in two ways on top of a state-of-the-art XML database engine and experimentally demonstrate that our implementations can bring significant speedup on a commodity  ...  Acknowledgements We would like to thank Christian Grün of the BaseX team for his technical comments and feedback on BaseX.  ... 
doi:10.1007/978-3-030-00063-9_7 fatcat:scvkpmmh3bgwxc5uuwaapihata

Apache VXQuery: A Scalable XQuery Implementation [article]

E. Preston Carman Jr. , Michael J. Carey Oracle Labs
2015 arXiv   pre-print
An experimental evaluation using a real 500GB dataset with various selection, aggregation and join XML queries shows that Apache VXQuery performs well both in terms of scale-up and speed-up.  ...  The wide use of XML for document management and data exchange has created the need to query large repositories of XML data.  ...  techniques and modern big data trends [20, 10] .  ... 
arXiv:1504.00331v1 fatcat:56dwi5tjbrczvn6blcupargzuy

Toward Intelligent Query Engines

Matthaios Olma, Stella Giannakopoulou, Manos Karpathiotakis, Anastasia Ailamaki
2019 IEEE Data Engineering Bulletin  
Data scientists spend most of their time on collecting and preparing data in order to efficiently and accurately extract valuable insights.  ...  To address the scalability issues of cleaning and tuning tasks, we inject cleaning operations into query processing, and adapt access paths on-the-fly.  ...  Finally, a tuner builds access paths for efficient access. The final result is stored in a clean and tuned database, and is ready to receive query requests.  ... 
dblp:journals/debu/OlmaGKA19 fatcat:qsxdoltagbcudect3m23rw54uu

Data Shapes and Data Transformations [article]

Michael Hausenblas and Boris Villazon-Terrazas and Richard Cyganiak
2012 arXiv   pre-print
Nowadays, information management systems deal with data originating from different sources including relational databases, NoSQL data stores, and Web data formats, varying not only in terms of data formats  ...  , but also in the underlying data model.  ...  Summary In Table 3 .2 we provide a summary of the data shapes transformation and their characteristics.  ... 
arXiv:1211.1565v1 fatcat:k2f3phkomvf3xlmzg7ciqbnyem

The relational XQuery puzzle: a look-back on the pieces found so far

Jens Teubner
2009 Computer Science - Research and Development  
Given the tremendous versatility of relational database implementations toward a wide range of database problems, it seems only natural to consider them as backends for XML data processing.  ...  As we dissect its components, we relate them to other work in the field and also point to open problems and limitations in the context of relational XQuery processing. selbstverständlich, diese Systeme  ...  Annotated with statistical information, such a summary provides a high estimation accuracy for common (and order-insensitive) paths with only small space overhead.  ... 
doi:10.1007/s00450-009-0058-8 fatcat:6gjgydq5pbhwppjzhfykj5vgma

High-performance complex event processing over hierarchical data

Barzan Mozafari, Kai Zeng, Loris D'antoni, Carlo Zaniolo
2013 ACM Transactions on Database Systems  
In this article, we present the XSeq language and system that support CEP on XML streams, via an extension of XPath that is both powerful and amenable to an efficient implementation.  ...  Besides the efficiency and expressivity benefits, the choice of VPA as the underlying model also enables XSeq to go beyond XML streams and be easily applicable to any data with both sequential and hierarchical  ...  ACKNOWLEDGMENTS We would like to thank the reviewers, Balder ten Cate, Alexander Shkapsky, Nikolay Laptev and Shi Gao for their comments.  ... 
doi:10.1145/2536779 fatcat:cbpt6fij5vb7rh5aa2qp5d4ilq
« Previous Showing results 1 — 15 out of 2,638 results