Sciweavers

241 search results - page 24 / 49
» Effective pruning for XML structural match queries
Sort
View
IDEAS
2005
IEEE
111views Database» more  IDEAS 2005»
14 years 1 months ago
Evaluation of Queries on Tree-Structured Data Using Dimension Graphs
The recent proliferation of XML-based standards and technologies for managing data on the Web demonstrates the need for effective and efficient management of treestructured data....
Theodore Dalamagas, Dimitri Theodoratos, Antonis K...
SIGMOD
2000
ACM
236views Database» more  SIGMOD 2000»
13 years 12 months ago
XTRACT: A System for Extracting Document Type Descriptors from XML Documents
XML is rapidly emerging as the new standard for data representation and exchange on the Web. An XML document can be accompanied by a Document Type Descriptor (DTD) which plays the...
Minos N. Garofalakis, Aristides Gionis, Rajeev Ras...
SIGMOD
2009
ACM
111views Database» more  SIGMOD 2009»
14 years 7 months ago
Language-model-based ranking in entity-relation graphs
We propose a language-model-based ranking approach for SPARQLlike queries on entity-relationship graphs. Our ranking model supports exact matching, approximate structure matching,...
Shady Elbassuoni, Maya Ramanath, Gerhard Weikum
CIKM
2005
Springer
14 years 1 months ago
Versatile structural disambiguation for semantic-aware applications
In this paper, we propose a versatile disambiguation approach which can be used to make explicit the meaning of structure based information such as XML schemas, XML document struc...
Federica Mandreoli, Riccardo Martoglia, Enrico Ron...
ICDE
2007
IEEE
128views Database» more  ICDE 2007»
14 years 9 months ago
Efficient Evaluation of All-Nearest-Neighbor Queries
The All Nearest Neighbor (ANN) operation is a commonly used primitive for analyzing large multi-dimensional datasets. Since computing ANN is very expensive, in previous works R*-t...
Yun Chen, Jignesh M. Patel