The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Vertical partitioning algorithms for database design
Open accessAbstract
This paper addresses the vertical partitioning of a set of logical records or a relation into fragments. The rationale behind vertical partitioning is to produce fragments, groups of attribute columns, that “closely match” the requirements of transactions. Vertical partitioning is applied in three contexts: a database stored on devices of a single type, a database stored in different memory levels, and a distributed database. In a two-level memory hierarchy, most transactions should be processed using the fragments in primary memory. In distributed databases, fragment allocation should maximize the amount of local transaction processing. Fragments may be nonoverlapping or overlapping. 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. The second phase performs cost optimization by incorporating the knowledge of a specific application environment. The algorithms presented in this paper have been implemented, and examples of their actual use are shown.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Query processing in a system for distributed databases (SDD-1)
Bernstein, P. A., Goodman, N., Wong, E., Reeve, C. L., & Rothnie, J. B. (1981) · ACM Transactions on Database Systems · doi:10.1145/319628.319650 · Cited by 493
Optimal allocation of resources in distributed information networks
Mahmoud, S., & Riordon, J. S. (1976) · ACM Transactions on Database Systems · doi:10.1145/320434.320449 · Cited by 174
Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases
Eisner, M. J., & Severance, D. G. (1976) · Journal of the ACM · doi:10.1145/321978.321982 · Cited by 173
Database Location in Computer Networks
Fisher, M. L., & Hochbaum, D. S. (1980) · Journal of the ACM · doi:10.1145/322217.322226 · Cited by 130
Reliability mechanisms for SDD-1: a system for distributed databases
Hammer, M. M., & Shipman, D. W. (1980) · ACM Transactions on Database Systems · doi:10.1145/320610.320621 · Cited by 128
Allocation of Operations in Distributed Database Access
Ceri, S., & Pelagatti (1982) · IEEE Transactions on Computers · doi:10.1109/tc.1982.1675957 · Cited by 34
Self-citation
Cited by
Query evaluation techniques for large databases
Graefe, G. (1993) · ACM Computing Surveys · doi:10.1145/152610.152611 · Cited by 1,262
Split learning for health: Distributed deep learning without sharing raw patient data
Vepakomma, P., Gupta, O., Swedish, T., & Raskar, R. (2018) · arXiv · doi:10.48550/arxiv.1812.00564 · Cited by 513
A survey of data partitioning and sampling methods to support big data analysis
Mahmud, M. S., Huang, J. Z., Salloum, S., Emara, T. Z., & Sadatdiynov, K. (2020) · Big Data Mining and Analytics · doi:10.26599/bdma.2019.9020015 · Cited by 282
Mozaffari, M., Dignös, A., Gamper, J., & Störl, U. (2024) · ACM Computing Surveys · doi:10.1145/3665323 · Cited by 17
Metadata
- Authors
- Navathe, S., Ceri, S., Wiederhold, G., & Dou, J.
- Venue
- ACM Transactions on Database Systems
- Published
- 1984-12-05
- Volume
- 9
- Issue
- 4
- Pages
- 680-710
- ISSN
- 0362-5915 (ISSN-L)
- 1557-4644
- OpenAlex
- W66807521
- Cited by
- 420
- References
- 6
- FWCI
- 6.04
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Vertical partitioning algorithms for database design. https://app.cochat.ai/papers/10.1145/1994.2209
- The paper
- Navathe, S., Ceri, S., Wiederhold, G., & Dou, J. (1984). Vertical partitioning algorithms for database design. ACM Transactions on Database Systems. https://doi.org/10.1145/1994.2209
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.