Abstract:Experimental work in the valuation of large scale data retrieval systems has been scarce due to its difficulty and prohibitive cost. This paper discusses a simulation model of a data retrieval system which has the effect of significantly reducing the cost of experimentation and enabling research never attempted before. The model is designed to estimate the retrieval workload of alternative data retrieval systems. These data retrieval systems can be organized under several database organizations, including inve… Show more
“…then there will be no reduction. We shall assume as Lowe [3] and Siler [4] did. that the number of tuples with the same A value is a random variable and is distributed according to Zipf's distribution [9].…”
In designing a physical database organization, one almost inevitably encounters the following estimating problem: Given k records to be retrieved out of a file of n records organized into m blocks, how many of the m blacks have to be accessed? A correct solution to this problem was given by B. Yao. The solution as a function o/Y(n, m. k) depends on the assumptions that n, m, and k are nonstochastic, as well as uniform block size. This paper examines the validity of this function when some of the assumptions are not true. CommunicQlions of the ACM N'umberll
“…then there will be no reduction. We shall assume as Lowe [3] and Siler [4] did. that the number of tuples with the same A value is a random variable and is distributed according to Zipf's distribution [9].…”
In designing a physical database organization, one almost inevitably encounters the following estimating problem: Given k records to be retrieved out of a file of n records organized into m blocks, how many of the m blacks have to be accessed? A correct solution to this problem was given by B. Yao. The solution as a function o/Y(n, m. k) depends on the assumptions that n, m, and k are nonstochastic, as well as uniform block size. This paper examines the validity of this function when some of the assumptions are not true. CommunicQlions of the ACM N'umberll
“…THEOREM 1. The expected response time for a query of complexity (d, c, p, q) is ~9 = S(L 5, P) + MS + 1, t, q) + Nt + 1, r, PP) + @r + 1, n, El, (13) where E = l~y,(q/N,)"-'Id.…”
Section: Presearch the Jik And Identify The "Essential"mentioning
confidence: 99%
“…Examples of single-attribute organization analysis include the VSAM model [6]. Previous models for multiattribute database organizations include the FOREM simulation model [lo], the analytic models developed by Lowe [8] and Martin [9], and the simulation models reported by Cardenas [2] and Siler [13], In each case, a given structure is analyzed and an analytic or simulation evaluation is performed. Since different assumptions and techniques are used in different analyses, it is dilhcult to compare results from individual models.…”
A generalized model for physical database organizations is presented. Existing database organizations are shown to fit easily into the model as special cases. Generalized access algorithms and cost equations associated with the model are developed and analyzed. The model provides a general design framework in which the distinguishing properties of database organizations are made explicit and their performances can be compared.
“…The answer is that problem and solution characteristics affect system performance in complex ways; their subtle relationships defy exact analysis. Though a noble quest for researchers [6,12,20,45,49,54], the search for optimal database designs seems to be an impossible task.…”
The physical organization of reformation w~thm a database has a major influence on the cost and performance of a computerized mformatmn system. The most efficient organization for a specific problem depends on the volume and intrinsm structure of stored mformatmn, the frequency and extent of updates, the formats and frequency of retrievals, and hardware accessing characteristms. Since these factors affect design performance m complex, subtle ways, an analyst faced with selecting a database design may well feel overwhelmed by the multitude of choices. This paper offers the practitioner a strmghtforward comparison of tradltmnal record-accessing structures. For the important class of apphcatmns lnvolwng a single record type, this article identifies the three most critical problem characteristms; it structures the essential macro-level design decisions; and it offers a procedure for choosing a reasonable data organization
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.