Sciweavers

85 search results - page 8 / 17
» Node Selection Query Languages for Trees
Sort
View
ICDE
2003
IEEE
209views Database» more  ICDE 2003»
15 years 11 months ago
An Evaluation of Regular Path Expressions with Qualifiers against XML Streams
This paper presents SPEX, a streamed and progressive evaluation of regular path expressions with XPath-like qualifiers against XML streams. SPEX proceeds as follows. An expression...
Dan Olteanu, François Bry, Tobias Kiesling
ICDE
2001
IEEE
106views Database» more  ICDE 2001»
15 years 11 months ago
Querying XML Documents Made Easy: Nearest Concept Queries
Due to the ubiquity and popularity of XML, users often are in the following situation: they want to query XML documents which contain potentially interesting information but they ...
Albrecht Schmidt 0002, Martin L. Kersten, Menzo Wi...
CIKM
2007
Springer
15 years 3 months ago
Evaluation of partial path queries on xml data
XML query languages typically allow the specification of structural patterns of elements. Finding the occurrences of such patterns in an XML tree is the key operation in XML quer...
Stefanos Souldatos, Xiaoying Wu, Dimitri Theodorat...
ICDT
2009
ACM
125views Database» more  ICDT 2009»
15 years 10 months ago
How big must complete XML query languages be?
Marx and de Rijke have shown that the navigational core of the w3c XML query language XPath is not first-order complete ? that is it cannot express every query definable in firsto...
Clemens Ley, Michael Benedikt
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
13 years 5 days ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu