Sciweavers

1142 search results - page 100 / 229
» On Supporting Containment Queries in Relational Database Man...
Sort
View
VLDB
1989
ACM
88views Database» more  VLDB 1989»
15 years 8 months ago
Estimating the Size of Generalized Transitive Closures
We present a framework for the estimation of the size of binary recursively defined relations. We show how the framework can be used to provide estimating algo rithms for the size...
Richard J. Lipton, Jeffrey F. Naughton
CLUSTER
2005
IEEE
15 years 10 months ago
Fast Query Processing by Distributing an Index over CPU Caches
Data intensive applications on clusters often require requests quickly be sent to the node managing the desired data. In many applications, one must look through a sorted tree str...
Xiaoqin Ma, Gene Cooperman
SIGMOD
2010
ACM
168views Database» more  SIGMOD 2010»
15 years 9 months ago
SimDB: a similarity-aware database system
The identification and processing of similarities in the data play a key role in multiple application scenarios. Several types of similarity-aware operations have been studied in ...
Yasin N. Silva, Ahmed M. Aly, Walid G. Aref, Per-&...
VLDB
1998
ACM
108views Database» more  VLDB 1998»
15 years 8 months ago
MindReader: Querying Databases Through Multiple Examples
Users often can not easily express their queries. For example, in a multimedia image by content setting, the user might want photographs with sunsets; in current systems, like QBI...
Yoshiharu Ishikawa, Ravishankar Subramanya, Christ...
ICDE
2007
IEEE
119views Database» more  ICDE 2007»
15 years 10 months ago
Practical Preference Relations for Large Data Sets
User-defined preferences allow personalized ranking of query results. A user provides a declarative specification of his/her preferences, and the system is expected to use that ...
Kenneth A. Ross, Peter J. Stuckey, Amélie M...