Performance Analysis of a Database Filter Search Hardware
IEEE Transactions on Computers
Performance Analysis of Disk Modulo Allocation Method for Cartesian Product Files
IEEE Transactions on Software Engineering
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)
Partial-match hash coding: benefits of redundancy
ACM Transactions on Database Systems (TODS)
Extendible hashing—a fast access method for dynamic files
ACM Transactions on Database Systems (TODS)
Hashing and trie algorithms for partial match retrieval
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
Optimality Properties of Multiple-Key Hashing Functions
Journal of the ACM (JACM)
Attribute based file organization in a paged memory environment
Communications of the ACM
Some properties of Cartesian product files
SIGMOD '80 Proceedings of the 1980 ACM SIGMOD international conference on Management of data
The Idea of De-Clustering and its Applications
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Parallel Processing of large node B-trees
IEEE Transactions on Computers
Semantic complexity of classes of relational queries and query independent data partitioning
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Optimal disk allocation for partial match queries
ACM Transactions on Database Systems (TODS)
Fast parallel similarity search in multimedia databases
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Efficient disk allocation for fast similarity searching
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
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
Efficient input and output for scientific simulations
Proceedings of the sixth workshop on I/O in parallel and distributed systems
(Almost) optimal parallel block access to range queries
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
GeMDA: A Multidimensional Data Partitioning Technique for Multiprocessor Database Systems
Distributed and Parallel Databases
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient declustering techniques for temporal access structures
ADC '01 Proceedings of the 12th Australasian database conference
A Hypergraph Based Approach to Declustering Problems
Distributed and Parallel Databases
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
Analysis and Comparison of Declustering Schemes for Interactive Navigation Queries
IEEE Transactions on Knowledge and Data Engineering
MAGIC: A Multiattribute Declustering Mechanism for Multiprocessor Database Machines
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Asymptotically Optimal Declustering Schemes for Range Queries
ICDT '01 Proceedings of the 8th International Conference on Database Theory
Study of Scalable Declustering Algorithms for Parallel Grid Files
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Distributed Linear Hashing and Parallel Projection in Main Memory Databases
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Hybrid-Range Partitioning Strategy: A New Declustering Strategy for Multiprocessor Database Machines
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
CMD: A Multidimensional Declustering Method for Parallel Data Systems
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
Declustering Objects for Visualization
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Optimal Parallel I/O for Range Queries through Replication
DEXA '02 Proceedings of the 13th International Conference on Database and Expert Systems Applications
Hierarchical Declustering Schemes for Range Queries
EDBT '00 Proceedings of the 7th International Conference on Extending Database Technology: Advances in Database Technology
Data partitioning and load balancing in parallel disk systems
The VLDB Journal — The International Journal on Very Large Data Bases
Multidimensional Declustering Schemes Using Golden Ratio and Kronecker Sequences
IEEE Transactions on Knowledge and Data Engineering
Asymptotically optimal declustering schemes for 2-dim range queries
Theoretical Computer Science - Database theory
New GDM-Based Declustering Methods for Parallel Range Queries
IDEAS '99 Proceedings of the 1999 International Symposium on Database Engineering & 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
Replicated declustering for arbitrary queries
Proceedings of the 2004 ACM symposium on Applied computing
Iterative-improvement-based declustering heuristics for multi-disk databases
Information Systems
Replicated declustering of spatial data
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Optimal data-space partitioning of spatial data for parallel I/O
Distributed and Parallel Databases
Efficient retrieval of replicated data
Distributed and Parallel Databases
Exploiting sequential access when declustering data over disks and MEMS-based storage
Distributed and Parallel Databases
Efficient parallel processing of range queries through replicated declustering
Distributed and Parallel Databases
Data space mapping for efficient I/O in large multi-dimensional databases
Information Systems
Information Sciences: an International Journal
Proceedings of the 2007 ACM symposium on Applied computing
A cache invalidation scheme for continuous partial match queries in mobile computing environments
Distributed and Parallel Databases
Divide-and-conquer scheme for strictly optimal retrieval of range queries
ACM Transactions on Storage (TOS)
A study on grid partition for declustering high-dimensional data
ADVIS'04 Proceedings of the Third international conference on Advances in Information Systems
Threshold based declustering in high dimensions
DEXA'05 Proceedings of the 16th international conference on Database and Expert Systems Applications
Optimal distributed declustering using replication
ICDT'05 Proceedings of the 10th international conference on Database Theory
Multi-attribute hashing of wireless data for content-based queries
ICDCIT'05 Proceedings of the Second international conference on Distributed Computing and Internet Technology
Generalized Optimal Response Time Retrieval of Replicated Data from Storage Arrays
ACM Transactions on Storage (TOS)
| Hi-index | 0.00 |
In this paper we present data distribution methods for parallel processing environment. The primary objective is to process partial match retrieval type queries for parallel devices.The main contribution of this paper is the development of a new approach called FX (Fieldwise eXclusive) distribution for maximizing data access concurrency. An algebraic property of exclusive-or operation, and field transformation techniques are fundamental to this data distribution techniques. We have shown through theorems and corollaries that this FX distribution approach performs better than other methods proposed earlier. We have also shown, by computing probability of optimal distribution and query response time, that FX distribution gives better performance than others over a large class of partial match queries. This approach presents a new basis in which optimal data distribution for more general type of queries can be formulated.