Sciweavers

6846 search results - page 409 / 1370
» Querying a summary of database
Sort
View
SSDBM
2010
IEEE
117views Database» more  SSDBM 2010»
15 years 11 months ago
Subspace Similarity Search: Efficient k-NN Queries in Arbitrary Subspaces
There are abundant scenarios for applications of similarity search in databases where the similarity of objects is defined for a subset of attributes, i.e., in a subspace, only. Wh...
Thomas Bernecker, Tobias Emrich, Franz Graf, Hans-...
DEXAW
2004
IEEE
206views Database» more  DEXAW 2004»
15 years 10 months ago
Adaptive Query Processing and the Grid: Opportunities and Challenges
Grid technologies have been developed in response to an increase in demand for computing applications designed to yield the benefits from collaboration, data sharing and sophistic...
Anastasios Gounaris, Norman W. Paton, Rizos Sakell...
DPD
2006
114views more  DPD 2006»
15 years 6 months ago
A novel approach to resource scheduling for parallel query processing on computational grids
Advances in network technologies and the emergence of Grid computing have both increased the need and provided the infrastructure for computation and data intensive applications to...
Anastasios Gounaris, Rizos Sakellariou, Norman W. ...
SIGMOD
2001
ACM
229views Database» more  SIGMOD 2001»
16 years 7 months ago
A Robust, Optimization-Based Approach for Approximate Answering of Aggregate Queries
The ability to approximately answer aggregation queries accurately and efficiently is of great benefit for decision support and data mining tools. In contrast to previous sampling...
Surajit Chaudhuri, Gautam Das, Vivek R. Narasayya
EDBT
2002
ACM
112views Database» more  EDBT 2002»
16 years 7 months ago
Querying with Intrinsic Preferences
The handling of user preferences is becoming an increasingly important issue in present-day information systems. Among others, preferences are used for information filtering and ex...
Jan Chomicki