Sciweavers

81 search results - page 13 / 17
» Evaluation Techniques for Generalized Path Pattern Queries o...
Sort
View
JACM
2008
91views more  JACM 2008»
13 years 7 months ago
On the minimization of XPath queries
XML queries are usually expressed by means of XPath expressions identifying portions of the selected documents. An XPath expression defines a way of navigating an XML tree and ret...
Sergio Flesca, Filippo Furfaro, Elio Masciari
TKDE
2012
194views Formal Methods» more  TKDE 2012»
11 years 10 months ago
A Query Formulation Language for the Data Web
— We present a query formulation language (called MashQL) in order to easily query and fuse structured data on the web. The main novelty of MashQL is that it allows people with l...
Mustafa Jarrar, Marios D. Dikaiakos
VLDB
2004
ACM
101views Database» more  VLDB 2004»
14 years 24 days ago
Taming XPath Queries by Minimizing Wildcard Steps
This paper presents a novel and complementary technique to optimize an XPath query by minimizing its wildcard steps. Our approach is based on using a general composite axis called...
Chee Yong Chan, Wenfei Fan, Yiming Zeng
IDEAS
2009
IEEE
192views Database» more  IDEAS 2009»
14 years 2 months ago
A cluster-based approach to XML similarity joins
A natural consequence of the widespread adoption of XML as standard for information representation and exchange is the redundant storage of large amounts of persistent XML documen...
Leonardo Ribeiro, Theo Härder, Fernanda S. Pi...
CIKM
2010
Springer
13 years 6 months ago
Fast and accurate estimation of shortest paths in large graphs
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...