Sciweavers

756 search results - page 123 / 152
» Recent progress with BOXES
Sort
View
STOC
2004
ACM
134views Algorithms» more  STOC 2004»
14 years 7 months ago
Better extractors for better codes?
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
Venkatesan Guruswami
VLDB
2004
ACM
161views Database» more  VLDB 2004»
14 years 7 months ago
Supporting top-k join queries in relational databases
Ranking queries produce results that are ordered on some computed score. Typically, these queries involve joins, where users are usually interested only in the top-k join results....
Ihab F. Ilyas, Walid G. Aref, Ahmed K. Elmagarmid
SIGMOD
2008
ACM
190views Database» more  SIGMOD 2008»
14 years 7 months ago
OLTP through the looking glass, and what we found there
Online Transaction Processing (OLTP) databases include a suite of features -- disk-resident B-trees and heap files, locking-based concurrency control, support for multi-threading ...
Stavros Harizopoulos, Daniel J. Abadi, Samuel Madd...
SIGMOD
2008
ACM
159views Database» more  SIGMOD 2008»
14 years 7 months ago
Bootstrapping pay-as-you-go data integration systems
Data integration systems offer a uniform interface to a set of data sources. Despite recent progress, setting up and maintaining a data integration application still requires sign...
Anish Das Sarma, Xin Dong, Alon Y. Halevy
SIGMOD
2006
ACM
127views Database» more  SIGMOD 2006»
14 years 7 months ago
Efficient reverse k-nearest neighbor search in arbitrary metric spaces
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...
Elke Achtert, Christian Böhm, Peer Kröge...