Sciweavers

481 search results - page 20 / 97
» Approximate XML Query Answers
Sort
View
ICDE
2004
IEEE
148views Database» more  ICDE 2004»
14 years 9 months ago
Approximate Selection Queries over Imprecise Data
We examine the problem of evaluating selection queries over imprecisely represented objects. Such objects are used either because they are much smaller in size than the precise on...
Iosif Lazaridis, Sharad Mehrotra
IS
2008
13 years 7 months ago
The complexity and approximation of fixing numerical attributes in databases under integrity constraints
Consistent query answering is the problem of characterizing and computing the semantically correct answers to queries from a database that may not satisfy certain integrity constr...
Leopoldo E. Bertossi, Loreto Bravo, Enrico Francon...
GEOINFO
2004
13 years 9 months ago
Approximate Spatial Query Processing using Raster Signatures
: Nowadays, the database characteristics, such as the huge volume of data, the complexity of the queries, and even the data availability, can demand minutes or hours to process a q...
Leonardo Guerreiro Azevedo, Rodrigo Salvador Monte...
FQAS
2006
Springer
100views Database» more  FQAS 2006»
13 years 11 months ago
Highly Heterogeneous XML Collections: How to Retrieve Precise Results?
Abstract. Highly heterogeneous XML collections are thematic collections exploiting different structures: the parent-child or ancestor-descendant relationships are not preserved and...
Ismael Sanz, Marco Mesiti, Giovanna Guerrini, Rafa...
WWW
2008
ACM
14 years 8 months ago
Efficient vectorial operators for processing xml twig queries
This paper proposes several vectorial operators for processing XML twig queries, which are easy to be performed and inherently efficient for both Ancestor-Descendant (A-D) and Par...
Guoliang Li, Jianhua Feng, Jianyong Wang, Feng Lin...