Precision Weighting—An Effective Automatic Indexing Method
Journal of the ACM (JACM)
Analysis of Effectiveness of Retrieval in Clustered Files
Journal of the ACM (JACM)
A relational model of data for large shared data banks
Communications of the ACM
SIGMOD '75 Proceedings of the 1975 ACM SIGMOD international conference on Management of data
Index selection in a self-adaptive data base management system
SIGMOD '76 Proceedings of the 1976 ACM SIGMOD international conference on Management of data
Computer Database Organization, 2nd Ed
Computer Database Organization, 2nd Ed
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
The SMART Retrieval System—Experiments in Automatic Document Processing
The SMART Retrieval System—Experiments in Automatic Document Processing
New techniques for best-match retrieval
ACM Transactions on Information Systems (TOIS)
User-oriented document clustering: a framework for learning in information retrieval
Proceedings of the 9th annual international ACM SIGIR conference on Research and development in information retrieval
A clustered search algorithm incorporating arbitrary term dependencies
ACM Transactions on Database Systems (TODS)
Generation and search of clustered files
ACM Transactions on Database Systems (TODS)
On the Construction of Feedback Queries
Journal of the ACM (JACM)
Query Optimization in Database Systems
ACM Computing Surveys (CSUR)
On the implementation of some models of document retrieval
SIGIR '79 Proceedings of the 2nd annual international ACM SIGIR conference on Information storage and retrieval: information implications into the eighties
A New Approach to Clustering Records in Information Retrieval Systems
Information Retrieval
Accurate estimation of the number of tuples satisfying a condition
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
A Statistical Method for Estimating the Usefulness of Text Databases
IEEE Transactions on Knowledge and Data Engineering
Information retrieval theory and design based on a model of the user's concept relations
SIGIR '80 Proceedings of the 3rd annual ACM conference on Research and development in information retrieval
Vector-based approach to analysis of file space properties
Progress in computer research
Determining Text Databases to Search in the Internet
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Data base system performance prediction using an analytical model (invited paper)
VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
| Hi-index | 0.00 |
The importance of the estimation of the number of desired records for a given query is outlined. Two algorithms for the estimation in the “closest neighbors problem” are presented. The numbers of operations of the algorithms are &Ogr;(ml2) and &Ogr;(ml), where m is the number of clusters and l is the “length” of the query.