Performance Analysis of Disk Modulo Allocation Method for Cartesian Product Files
IEEE Transactions on Software Engineering
An updated table of minimum-distance bounds for binary linear codes
IEEE Transactions on Information Theory
A case for redundant arrays of inexpensive disks (RAID)
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Optimal file distribution for partial match retrieval
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Declustering using error correcting codes
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the optimality of disk allocation for Cartesian product files (extended abstract)
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Disk allocation for Cartesian product files on multiple-disk systems
ACM Transactions on Database Systems (TODS)
Optimal partial-match retrieval when fields are independently specified
ACM Transactions on Database Systems (TODS)
Parallel searching for binary Cartesian product files
CSC '85 Proceedings of the 1985 ACM thirteenth annual conference on Computer Science
Attribute based file organization in a paged memory environment
Communications of the ACM
Declustering of key-based partitioned signature files
ACM Transactions on Database Systems (TODS)
Efficient disk allocation for fast similarity searching
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Clustering declustered data for efficient retrieval
Proceedings of the eighth international conference on Information and knowledge management
GeMDA: A Multidimensional Data Partitioning Technique for Multiprocessor Database Systems
Distributed and Parallel Databases
Efficient declustering techniques for temporal access structures
ADC '01 Proceedings of the 12th Australasian database conference
Packing Arrays and Packing Designs
Designs, Codes and Cryptography
Optimal Bucket Allocation Design of k-ary MKH Files for Partial Match Retrieval
IEEE Transactions on Knowledge and Data Engineering
Scalability Analysis of Declustering Methods for Multidimensional Range Queries
IEEE Transactions on Knowledge and Data Engineering
A Stochastic Programming Approach for Range Query Retrieval Problems
IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Parallel and Distributed Systems
Hamming Filters: A Dynamic Signature File Organization for Parallel Stores
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Optimal Parallel I/O for Range Queries through Replication
DEXA '02 Proceedings of the 13th International Conference on Database and Expert Systems Applications
Disk Allocation for Fast Range and Nearest-Neighbor Queries
Distributed and Parallel Databases
(Almost) Optimal parallel block access for range queries
Information Sciences—Informatics and Computer Science: An International Journal
Theoretical Computer Science - Latin American theorotical informatics
Efficient parallel processing of range queries through replicated declustering
Distributed and Parallel Databases
IEEE Transactions on Knowledge and Data Engineering
Data space mapping for efficient I/O in large multi-dimensional databases
Information Systems
A cache invalidation scheme for continuous partial match queries in mobile computing environments
Distributed and Parallel Databases
Multi-attribute hashing of wireless data for content-based queries
ICDCIT'05 Proceedings of the Second international conference on Distributed Computing and Internet Technology
Allocating relations in a distributed database system
Mathematical and Computer Modelling: An International Journal
| Hi-index | 0.00 |
The problem of disk allocation addresses the issue of how to distribute a file on several disks in order to maximize concurrent disk accesses in response to a partial match query. In this paper a coding-theoretic analysis of this problem is presented, and both necessary and sufficient conditions for the existence of strictly optimal allocation methods are provided. Based on a class of optimal codes, known as maximum distance separable codes, strictly optimal allocation methods are constructed. Using the necessary conditions proved, we argue that the standard definition of strict optimality is too strong and cannot be attained, in general. Hence, we reconsider the definition of optimality. Instead of basing it on an abstract definition that may not be attainable, we propose a new definition based on the best possible allocation method. Using coding theory, allocation methods that are optimal according to our proposed criterion are developed.