Book ChapterDOI
Vertical Partitioning Algorithms in Distributed Databases
Marta Zorilla,Eduardo Mora,Pedro Corcuera,J. Fernández +3 more
- pp 465-474
TLDR
Two vertical fragmentation methods are described, the classic NAVATHE method and the newer FURD method, as well as the two proposed in this paper, the FurD-FDEZ and the F URD WITH REPLICATION methods.Abstract:
Data distribution is a crucial problem affecting the cost and efficient use of these systems. The problem is further exacerbated by the lack of methods and support tools for the design of distributed databases. This paper outlines some of the main techniques currently used for data distribution, such as vertical partitioning and replication. Two vertical fragmentation methods are described, the classic NAVATHE method and the newer FURD method, as well as the two proposed in this paper, the FURD-FDEZ and the FURD WITH REPLICATION methods.read more
Citations
More filters
Patent
Fuzzy data operations
TL;DR: In this paper, a method for clustering data elements stored in a data storage system includes reading data elements from the storage system, where clusters of data elements are formed with each data element being a member of at least one cluster.
Patent
Managing an archive for approximate string matching
TL;DR: In this article, a method for managing an archive for determining approximate matches associated with strings occurring in records is described, which includes processing records to determine a set of string representations that correspond to string occurring in the records; generating, for each of at least some of the string representations in the set, a plurality of close representations that are each generated from at leastsome of the same characters in the string; and storing entries in the archive that each represent a potential approximate match between at least two strings based on their respective close representations.
Patent
Data clustering based on candidate queries
Arlen Anderson,Kamil Trojan +1 more
TL;DR: In this paper, a matched data cluster is identified based on a cluster membership criterion for at least one candidate data cluster of one or more existing data clusters containing the candidate data records.
Patent
Data clustering, segmentation, and parallelization
TL;DR: In this paper, a first set of original records is processed by a first processing entity to generate a second set of records that includes the original records and one or more copies of each original record.
Patent
Data clustering based on variant token networks
TL;DR: In this paper, received data records are processed to identify one or more data clusters and a graphical representation of the network with different subsets of nodes distinguished based at least in part on values associated with nodes.
References
More filters
Book
Principles of Distributed Database Systems
M. Tamer zsu,Patrick Valduriez +1 more
TL;DR: This third edition of a classic textbook can be used to teach at the senior undergraduate and graduate levels and concentrates on fundamental theories as well as techniques and algorithms in distributed data management.
Journal ArticleDOI
Vertical partitioning algorithms for database design
TL;DR: In this paper, the vertical partitioning of a set of logical records or a relation into fragments is proposed to produce fragments, groups of attribute columns, that "closely match" the requirements of transactions.
Book
Vertical partitioning algorithms for database design
TL;DR: A two-phase approach for the determination of fragments is proposed; in the first phase, the design is driven by empirical objective functions which do not require specific cost information, and the second phase performs cost optimization by incorporating the knowledge of a specific application environment.
Journal ArticleDOI
Data allocation in distributed database systems
TL;DR: The problem of allocating the data of a database to the sites of a communication network is investigated and a model that makes it possible to compare the cost of allocations is presented.
Proceedings ArticleDOI
A formal approach to the vertical partitioning problem in distributed database design
TL;DR: The n-ary vertical partitioning problem is addressed, and an objective function that generalizes and subsumes earlier work is derived that provides a basis for developing heuristic algorithms for vertical partitions.