Sciweavers

552 search results - page 7 / 111
» Efficient Algorithms for Processing XPath Queries
Sort
View
SIGMOD
2011
ACM
249views Database» more  SIGMOD 2011»
14 years 8 days ago
ProApproX: a lightweight approximation query processor over probabilistic trees
We demonstrate a system for querying probabilistic XML documents with simple XPath queries. A user chooses between a variety of query answering techniques, both exact and approxim...
Pierre Senellart, Asma Souihli
169
Voted
ICDE
2009
IEEE
156views Database» more  ICDE 2009»
15 years 11 months ago
Distributed Structural Relaxation of XPath Queries
Due to the structural heterogeneity of XML, queries are often interpreted approximately. This is achieved by relaxing the query and ranking the results based on their relevance to ...
Georgia Koloniari, Evaggelia Pitoura
WWW
2005
ACM
15 years 10 months ago
Answering order-based queries over XML data
Order-based queries over XML data include XPath navigation axes such as following-sibling and following. In this paper, we present holistic algorithms that evaluate such order-bas...
Zografoula Vagena, Nick Koudas, Divesh Srivastava,...
SIGMOD
2004
ACM
163views Database» more  SIGMOD 2004»
15 years 9 months ago
FleXPath: Flexible Structure and Full-Text Querying for XML
Querying XML data is a well-explored topic with powerful databasestyle query languages such as XPath and XQuery set to become W3C standards. An equally compelling paradigm for que...
Sihem Amer-Yahia, Laks V. S. Lakshmanan, Shashank ...
CIKM
2005
Springer
15 years 3 months ago
Incremental evaluation of a monotone XPath fragment
This paper shows a scheme for incremental evaluation of XPath queries. Here, we focus on a monotone fragment of XPath, i.e., when a data is deleted from (or inserted to) the datab...
Hidetaka Matsumura, Keishi Tajima