Sciweavers

6650 search results - page 528 / 1330
» Mutating database queries
Sort
View
PODS
2010
ACM
207views Database» more  PODS 2010»
16 years 7 hour ago
Understanding cardinality estimation using entropy maximization
Cardinality estimation is the problem of estimating the number of tuples returned by a query; it is a fundamentally important task in data management, used in query optimization, ...
Christopher Ré, Dan Suciu
PODS
2000
ACM
112views Database» more  PODS 2000»
15 years 11 months ago
Auditing Boolean Attributes
We study the problem of auditing databases which support statistical sum queries to protect the security of sensitive information; we focus on the special case in which the sensit...
Jon M. Kleinberg, Christos H. Papadimitriou, Prabh...
SAC
2011
ACM
14 years 9 months ago
Site-autonomous distributed semantic caching
Semantic caching augments cached data with a semantic description of the data. These semantic descriptions can be used to improve execution time for similar queries by retrieving ...
Norvald H. Ryeng, Jon Olav Hauglid, Kjetil N&oslas...
VLDB
2008
ACM
147views Database» more  VLDB 2008»
16 years 7 months ago
Tree-based partition querying: a methodology for computing medoids in large spatial datasets
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous e...
Kyriakos Mouratidis, Dimitris Papadias, Spiros Pap...
VLDB
2007
ACM
155views Database» more  VLDB 2007»
16 years 1 months ago
Best Position Algorithms for Top-k Queries
The general problem of answering top-k queries can be modeled using lists of data items sorted by their local scores. The most efficient algorithm proposed so far for answering to...
Reza Akbarinia, Esther Pacitti, Patrick Valduriez