ACM Computing Surveys (CSUR) - Annals of discrete mathematics, 24
The BANG file: A new kind of grid file
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Gray Codes for Partial Match and Range Queries
IEEE Transactions on Software Engineering
Annals of Operations Research
Optimal disk allocation for partial match queries
ACM Transactions on Database Systems (TODS)
On the analysis of indexing schemes
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On two-dimensional indexability and optimal range search indexing
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The Grid File: An Adaptable, Symmetric Multikey File Structure
ACM Transactions on Database Systems (TODS)
Disk allocation for Cartesian product files on multiple-disk systems
ACM Transactions on Database Systems (TODS)
Partial-match retrieval using hashing and descriptors
ACM Transactions on Database Systems (TODS)
Optimal partial-match retrieval when fields are independently specified
ACM Transactions on Database Systems (TODS)
Hashing and trie algorithms for partial match retrieval
ACM Transactions on Database Systems (TODS)
Optimality Properties of Multiple-Key Hashing Functions
Journal of the ACM (JACM)
A Lower Bound on the Complexity of Orthogonal Range Queries
Journal of the ACM (JACM)
The interpolation-based grid file
PODS '85 Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems
Data Structures for Range Searching
ACM Computing Surveys (CSUR)
The Quadtree and Related Hierarchical Data Structures
ACM Computing Surveys (CSUR)
Analysis and performance of inverted data base structures
Communications of the ACM
Attribute based file organization in a paged memory environment
Communications of the ACM
Elements of the randomized combinatorial file structure
SIGIR '71 Proceedings of the 1971 international ACM SIGIR conference on Information storage and retrieval
Introductory Combinatorics
The K-D-B-tree: a search structure for large multidimensional dynamic indexes
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
Interpolation-based index maintenance
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Storage mappings for multidimensional linear dynamic hashing
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Efficient Signature File Methods for Text Retrieval
IEEE Transactions on Knowledge and Data Engineering
Optimal Bucket Allocation Design of k-ary MKH Files for Partial Match Retrieval
IEEE Transactions on Knowledge and Data Engineering
Fast Text Access Methods for Optical and Large Magnetic Disks: Designs and Performance Comparison
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
Virtual Traffic Path Optimization in Connection-Oriented Networks with Stochastic Traffic
Journal of Network and Systems Management
| Hi-index | 0.00 |
One of the important issues in range query (RQ) retrieval problems is to determine the key's resolution for multiattribute records. Conventional models need to be improved because of potential degeneracy, less desired computability, and possible inconsistency with the partial match query (PMQ) models. This paper presents a new RQ model to overcome these drawbacks and introduces a new methodology, stochastic programming (SP), to conduct the optimization process. The model is established by using a monotone increasing function to characterize range sizes. Three SP approaches, wait-and-see(WS), here-and-now (HN), and scenario tracking (ST) methods are integrated into this RQ model. Analytical expressions of the optimal solution are derived. It seems that HN has advantage over WS because the latter usually involves complicated multiple summations or integrals. For the ST method, a nonlinear programming software package is designed. Results of numerical experiments are presented that optimized a 10-dimensional RQ model and tracked a middle size (100) and a large size (1,000) scenarios.