Sciweavers

16430 search results - page 2799 / 3286
» On Computable Tree Functions
Sort
View
VLDB
2009
ACM
159views Database» more  VLDB 2009»
16 years 7 months ago
Anytime measures for top-k algorithms on exact and fuzzy data sets
Top-k queries on large multi-attribute data sets are fundamental operations in information retrieval and ranking applications. In this article, we initiate research on the anytime ...
Benjamin Arai, Gautam Das, Dimitrios Gunopulos, Ni...
SIGMOD
2007
ACM
122views Database» more  SIGMOD 2007»
16 years 7 months ago
XQuery layers
XML is the data interoperability standard in many application domains. Therefore, an increasing number of researchers and professionals, who are not computer scientists (although ...
Daniele Braga, Alessandro Campi, Stefano Ceri, Pao...
SIGMOD
2005
ACM
109views Database» more  SIGMOD 2005»
16 years 7 months ago
Query-Sensitive Embeddings
A common problem in many types of databases is retrieving the most similar matches to a query object. Finding those matches in a large database can be too slow to be practical, es...
Vassilis Athitsos, Marios Hadjieleftheriou, George...
SIGMOD
2005
ACM
100views Database» more  SIGMOD 2005»
16 years 7 months ago
A Disk-Based Join With Probabilistic Guarantees
One of the most common operations in analytic query processing is the application of an aggregate function to the result of a relational join. We describe an algorithm for computi...
Chris Jermaine, Alin Dobra, Subramanian Arumugam, ...
PODS
2006
ACM
134views Database» more  PODS 2006»
16 years 7 months ago
Approximate quantiles and the order of the stream
Recently, there has been an increased focus on modeling uncertainty by distributions. Suppose we wish to compute a function of a stream whose elements are samples drawn independen...
Sudipto Guha, Andrew McGregor
« Prev « First page 2799 / 3286 Last » Next »