Sciweavers

6654 search results - page 375 / 1331
» Querying Faceted Databases
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. ...
VLDB
2007
ACM
152views Database» more  VLDB 2007»
16 years 7 months ago
Structured Materialized Views for XML Queries
The performance of XML database queries can be greatly enhanced by rewriting them using materialized views. We study the problem of rewriting a query using materialized views, whe...
Andrei Arion, Ioana Manolescu, Véronique Be...
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