Sciweavers

714 search results - page 65 / 143
» Phase4: Automatic Evaluation of Database Search Methods
Sort
View
EDBT
2009
ACM
156views Database» more  EDBT 2009»
15 years 8 months ago
Evaluating very large datalog queries on social networks
We consider a near future scenario in which users of a Web 2.0 application, such as a social network, contribute to the application not only data, but also rules which automatical...
Royi Ronen, Oded Shmueli
SIGMOD
2006
ACM
127views Database» more  SIGMOD 2006»
16 years 4 months ago
Efficient reverse k-nearest neighbor search in arbitrary metric spaces
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...
Elke Achtert, Christian Böhm, Peer Kröge...
CPAIOR
2008
Springer
15 years 6 months ago
The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
Daniel H. Leventhal, Meinolf Sellmann
144
Voted
ESE
2006
100views Database» more  ESE 2006»
15 years 4 months ago
An evaluation of combination strategies for test case selection
This paper presents results from a comparative evaluation of five combination strategies. Combination strategies are test case selection methods that combine "interesting&quo...
Mats Grindal, Birgitta Lindström, Jeff Offutt...
ICDE
2007
IEEE
141views Database» more  ICDE 2007»
15 years 10 months ago
Self Managing Top-k (Summary, Keyword) Indexes in XML Retrieval
Retrieval queries that combine structural constraints with keyword search represent a significant challenge to XML data management systems. Queries are expected to be answered as...
Mariano P. Consens, Xin Gu, Yaron Kanza, Flavio Ri...