Synonyms
Heterogeneously distributed data
Definition
Data is said to be vertically partitioned when several organizations own different attributes of information for the same set of entities. Thus, vertical partitioning of data can formally be defined as follows: First, define a dataset D in terms of the entities for whom the data are collected and the information that is collected for each entity. Thus, D ≡ (E, I), where E is the entity set for whom information is collected and I is the feature set that is collected. Assume that there are k different sites, P1,…,Pk collecting datasets D1 ≡ (E1, I1),…,Dk ≡ (Ek, Ik) respectively. Therefore, data is said to be vertically partitioned if E = ⋂iEi = E1 ⋂…⋂ Ek , and I = ⋃iIi = I1 ⋃…⋃ Ik. In general, distributed data can be arbitrarily partitioned. Vertical partitioning can also be defined as a special case of arbitrary partitioning, where all of the partitions consist of information about the same set of entities.
Key Points
In general, data...
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
Vaidya J, Clifton C, Zhu M. Privacy-Preserving Data Mining, Advances in information security 19. 1st ed. Berlin: Springer; 2005.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Section Editor information
Rights and permissions
Copyright information
© 2018 Springer Science+Business Media, LLC, part of Springer Nature
About this entry
Cite this entry
Vaidya, J. (2018). Vertically Partitioned Data. In: Liu, L., Özsu, M.T. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-8265-9_1047
Download citation
DOI: https://doi.org/10.1007/978-1-4614-8265-9_1047
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-8266-6
Online ISBN: 978-1-4614-8265-9
eBook Packages: Computer ScienceReference Module Computer Science and Engineering