Sciweavers

2514 search results - page 213 / 503
» On the Computation of Approximations of Database Queries
Sort
View
ICDE
2009
IEEE
122views Database» more  ICDE 2009»
16 years 8 months ago
Best-Effort Top-k Query Processing Under Budgetary Constraints
Abstract-- We consider a novel problem of top-k query processing under budget constraints. We provide both a framework and a set of algorithms to address this problem. Existing alg...
Michal Shmueli-Scheuer, Chen Li, Yosi Mass, Haggai...
EDBT
2000
ACM
15 years 10 months ago
Management and Query Processing of One-Dimensional Intervals with the UB-Tree
The management and query processing of one dimensional intervals is a special case of extended object handling. One dimensional intervals play an important role in temporal databa...
Robert Fenk
SIGMOD
2010
ACM
155views Database» more  SIGMOD 2010»
15 years 5 months ago
Querying RDF streams with C-SPARQL
Continuous SPARQL (C-SPARQL) is a new language for continuous queries over streams of RDF data. CSPARQL queries consider windows, i.e., the most recent triples of such streams, ob...
Davide Francesco Barbieri, Daniele Braga, Stefano ...
VLDB
2004
ACM
114views Database» more  VLDB 2004»
15 years 12 months ago
Hardware Acceleration in Commercial Databases: A Case Study of Spatial Operations
Traditional databases have focused on the issue of reducing I/O cost as it is the bottleneck in many operations. As databases become increasingly accepted in areas such as Geograp...
Nagender Bandi, Chengyu Sun, Amr El Abbadi, Divyak...
ECCV
2010
Springer
15 years 9 months ago
Avoiding confusing features in place recognition
We seek to recognize the place depicted in a query image using a database of “street side” images annotated with geolocation information. This is a challenging task due to chan...