Query processing in a system for distributed databases (SDD-1)
ACM Transactions on Database Systems (TODS)
Batched searching of sequential and tree structured files
ACM Transactions on Database Systems (TODS)
An attribute based model for database access cost analysis
ACM Transactions on Database Systems (TODS)
ACM Transactions on Information Systems (TOIS)
Estimating block accesses and number of records in file management
Communications of the ACM
The distribution of granule accesses made by database transactions
Communications of the ACM
Analysis of locking policies in database management systems
Communications of the ACM
Approximating block accesses in database organizations
Communications of the ACM
A stochastic evaluation model for database organizations in data retrieval systems
Communications of the ACM
Analysis and performance of inverted data base structures
Communications of the ACM
Application of an analytical model to evaluate storage structures
SIGMOD '76 Proceedings of the 1976 ACM SIGMOD international conference on Management of data
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
The Size of Projections of Relations Satisfying a Functional Dependency
VLDB '82 Proceedings of the 8th International Conference on Very Large Data Bases
The effects of concurrency control on the performance of database management systems.
The effects of concurrency control on the performance of database management systems.
An analytic model of physical databases
An analytic model of physical databases
Estimating selectivities in data bases
Estimating selectivities in data bases
Note on the expected size of a join
ACM SIGMOD Record
Database performance evaluation in an indexed file environment
ACM Transactions on Database Systems (TODS)
Analysis of retrieval performance for records and objects using optical disk technology
ACM Transactions on Database Systems (TODS)
The effect of join selectives on optimal nesting order
ACM SIGMOD Record
Statistical profile estimation in database systems
ACM Computing Surveys (CSUR)
Dynamic query evaluation plans
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Index scans using a finite LRU buffer: a validated I/O model
ACM Transactions on Database Systems (TODS)
Performance of a two-headed disk system when serving database queries under the scan policy
ACM Transactions on Database Systems (TODS)
IEEE Transactions on Software Engineering
Estimating the size of generalized transitive closures
VLDB '89 Proceedings of the 15th international conference on Very large data bases
Practical selectivity estimation through adaptive sampling
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Intelligent database caching through the use of page-answers and page-traces
ACM Transactions on Database Systems (TODS)
Optimal histograms for limiting worst-case error propagation in the size of join results
ACM Transactions on Database Systems (TODS)
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Adaptive selectivity estimation using query feedback
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Balancing histogram optimality and practicality for query result size estimation
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Towards a theory of cost management for digital libraries and electronic commerce
ACM Transactions on Database Systems (TODS)
Query size estimation by adaptive sampling (extended abstract)
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Implications of certain assumptions in database performance evauation
ACM Transactions on Database Systems (TODS)
Adaptive information system design: one query at a time
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
A model of data distribution based on texture analysis
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
Query Optimization in Database Systems
ACM Computing Surveys (CSUR)
Signature files: an access method for documents and its analytical performance evaluation
ACM Transactions on Information Systems (TOIS)
Effective Query Size Estimation Using Neural Networks
Applied Intelligence
Accurate estimation of the number of tuples satisfying a condition
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Performance Issues in Distributed Query Processing
IEEE Transactions on Parallel and Distributed Systems
A Method for Design and Performance Modeling of Client/Server Systems
IEEE Transactions on Software Engineering
Framework for the development of an experimental mixed-mode message system
SIGIR '84 Proceedings of the 7th annual international ACM SIGIR conference on Research and development in information retrieval
Development of a Multimedia Information System for an Office Environment
VLDB '84 Proceedings of the 10th International Conference on Very Large Data Bases
Estimating Block Accessses when Attributes are Correlated
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Universality of Serial Histograms
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
IDEAS '99 Proceedings of the 1999 International Symposium on Database Engineering & Applications
Interchanging group-by and join in distributed query processing
CASCON '93 Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: distributed computing - Volume 2
Estimating query result sizes for proxy caching in scientific database federations
Proceedings of the 2006 ACM/IEEE conference on Supercomputing
| Hi-index | 0.00 |
In this paper we provide estimates of the number of sequential and random block accesses required for retrieving a number of records of a file when the distribution of records in blocks of secondary storage is not uniform. We show how these results apply to estimating sizes of joins and semi-joins. We prove that when the uniformity of placement assumption is not satisfied it often leads to pessimistic estimates of performance. Finally we show a recursive estimation of the probability distribution of the number of blocks containing a given number of records.