Data structures and algorithms 3: multi-dimensional searching and computational geometry
Data structures and algorithms 3: multi-dimensional searching and computational geometry
International Journal of Man-Machine Studies
Framework for the development of an experimental mixed-mode message system
Proc. of the third joint BCS and ACM symposium on Research and development in information retrieval
Evaluation of access methods to text documents in office systems
Proc. of the third joint BCS and ACM symposium on Research and development in information retrieval
Data base management systems (2nd ed.)
Data base management systems (2nd ed.)
ACM Computing Surveys (CSUR) - Annals of discrete mathematics, 24
An introduction to database systems: vol. I (4th ed.)
An introduction to database systems: vol. I (4th ed.)
A framework for choosing a database query language
ACM Computing Surveys (CSUR)
Nearest neighbour searching in serial files using text signature
Journal of Information Science
Parallel free-text search on the connection machine system
Communications of the ACM - Special issue on parallelism
Comments on batched searching of sequential and tree-structured files
ACM Transactions on Database Systems (TODS)
Optimization of inverted vector searches
SIGIR '85 Proceedings of the 8th annual international ACM SIGIR conference on Research and development in information retrieval
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Incremental compilation of optimized code
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Multikey retrieval from K-d trees and QUAD-trees
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
A unifying model of physical databases
ACM Transactions on Database Systems (TODS)
Generation and search of clustered files
ACM Transactions on Database Systems (TODS)
Batched searching of sequential and tree structured files
ACM Transactions on Database Systems (TODS)
Algorithms for parsing search queries in systems with inverted file organization
ACM Transactions on Database Systems (TODS)
Data Structures for Range Searching
ACM Computing Surveys (CSUR)
Human Factors Studies of Database Query Languages: A Survey and Assessment
ACM Computing Surveys (CSUR)
Query Optimization in Database Systems
ACM Computing Surveys (CSUR)
The Quadtree and Related Hierarchical Data Structures
ACM Computing Surveys (CSUR)
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Information Systems (TOIS)
Analysis and performance of inverted data base structures
Communications of the ACM
The nearest neighbour problem in information retrieval: an algorithm using upperbounds
SIGIR '81 Proceedings of the 4th annual international ACM SIGIR conference on Information storage and retrieval: theoretical issues in information retrieval
Current practice in the evaluation of multikey search algorithms
SIGIR '83 Proceedings of the 6th annual international ACM SIGIR conference on Research and development in information retrieval
Information Retrieval
Information Retrieval: Computational and Theoretical Aspects
Information Retrieval: Computational and Theoretical Aspects
Database Design
Introduction to Modern Information Retrieval
Introduction to Modern Information Retrieval
Performance comparison of index structures for multi-key retrieval
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Dynamic information and library processing
Dynamic information and library processing
Computer
| Hi-index | 0.02 |
Queries to information retrieval systems are often incrementally specified as a result of user interaction with the system. However, most discussions of file organizations consider only completely specified queries. The choice of file organizations to support such incremental specification is discussed qualitatively in this extended abstract. (Quantitative comparisons are partially complete and are not presented here.) Organizations which are advantageous for completely specified queries are not necessarily so for incrementally specified queries (and vice versa).