Sciweavers

479 search results - page 18 / 96
» Efficient Processing of XML Tree Pattern Queries
Sort
View
WEBDB
2009
Springer
112views Database» more  WEBDB 2009»
14 years 3 months ago
Querying DAG-shaped Execution Traces Through Views
The question whether a given set of views, defined by queries, can be used to answer another query, arises in several contexts such as query optimization, data integration and se...
Maya Ben-Ari, Tova Milo, Elad Verbin
DASFAA
2004
IEEE
138views Database» more  DASFAA 2004»
14 years 25 days ago
Counting Relaxed Twig Matches in a Tree
Abstract. We consider the problem of accurately estimating the number of approximate XML answers for a given query, and propose an efficient method that (1) accurately computes sel...
Dongwon Lee, Divesh Srivastava
IDEAS
2005
IEEE
137views Database» more  IDEAS 2005»
14 years 2 months ago
Order-Sensitive XML Query Processing over Relational Sources: An Algebraic Approach
The XML data is order-sensitive. The order problem, that is how ordered XML documents and order-sensitive queries over it can be efficiently supported when mapped into the unorde...
Ling Wang, Song Wang, Brian Murphy, Elke A. Runden...
XIMEP
2005
ACM
174views Database» more  XIMEP 2005»
14 years 2 months ago
NaXDB - Realizing Pipelined XQuery Processing in a Native XML Database System
Supporting queries and modifications on XML documents is a challenging task, and several related approaches exist. When implementing query and modification languages efficientl...
Jens Hündling, Jan Sievers, Mathias Weske
BXML
2004
13 years 10 months ago
Binary Queries and XML Transformations
: We present a grammar-based approach to specifying k-ary queries for XML documents. k-ary queries simultaneously locate k nodes of an input tree as specified by a given relation. ...
Alexandru Berlea