Sciweavers

2514 search results - page 126 / 503
» On the Computation of Approximations of Database Queries
Sort
View
ICDT
2009
ACM
149views Database» more  ICDT 2009»
16 years 7 months ago
Query languages for data exchange: beyond unions of conjunctive queries
The class of unions of conjunctive queries (UCQ) has been shown to be particularly well-behaved for data exchange; its certain answers can be computed in polynomial time (in terms...
Juan Reutter, Marcelo Arenas, Pablo Barceló
SSD
1999
Springer
105views Database» more  SSD 1999»
15 years 10 months ago
Requirements of Traffic Telematics to Spatial Databases
Traffic telematics comprises services like traffic information, navigation, and emergency call services. Providers of such services need large spatial databases especially for the ...
Thomas Brinkhoff
SSD
2007
Springer
124views Database» more  SSD 2007»
16 years 16 days ago
Querying Objects Modeled by Arbitrary Probability Distributions
In many modern applications such as biometric identification systems, sensor networks, medical imaging, geology, and multimedia databases, the data objects are not described exact...
Christian Böhm, Peter Kunath, Alexey Pryakhin...
VLDB
2007
ACM
145views Database» more  VLDB 2007»
16 years 6 months ago
LCS-TRIM: Dynamic Programming Meets XML Indexing and Querying
In this article, we propose a new approach for querying and indexing a database of trees with specific applications to XML datasets. Our approach relies on representing both the q...
Shirish Tatikonda, Srinivasan Parthasarathy, Matth...
FQAS
2009
Springer
202views Database» more  FQAS 2009»
16 years 1 months ago
Controlled Aggregate Tree Shaped Questions over Ontologies
Abstract. Controlled languages (CLs) are ambiguity-free subsets of natural languages such as English offering a good trade-off between the formal rigor of ontology and query langua...
Camilo Thorne, Diego Calvanese