Analysis of Overflow Handling for Variable Length Records
نویسندگان
چکیده
Although files with variable length records are very frequent in actual databases due to variable length fields, missing attribute values, multiple values of an attribute and compression, little has been reported in the literature about file structures appropriate for variable length records. In this paper we describe and analyze several overflow handling techniques for the case when records are of variable length. We develop analytic models that take into account variable length records and study the performance in the context of indexed sequential (ISAM) files. We also propose a new overflow handling technique and show that it provides an incremental reorganization capability appropriate for handling variable length records. Analytic results demonstrate that its performance is better than the performance of previous methods, The overflow handling techniques and the analytic methods developed in this paper are also applicable to other file structures with variable length records that require overtlow handling.
منابع مشابه
Algorithms for a hashed file with variable-length records
Variable-length records are very frequent in database environments. This work gives a set of algorithms for maintaining a new model of static hashed files designed to accommodate variable-length records. Two special techniques for variable-length records are used. First, records are ordered by length and not by key value, e.g., the shortest (longest) records are stored in the main (overflow) bl...
متن کاملFile organizations with shared overflow blocks for variable length objects
Traditional file organizations for records may also be appropriate for the storage and retrieval of objects. Since objects frequently involve diverse data types (such as text, compressed images, graphics, etc.) as well as composite structures, they may have a largely variable length. In this paper, we assume that in the case of composite objects their components are clustered together and that ...
متن کاملOptimum Storage Allocation for a File in Steady State
A file of fixed-length records in auxiliary storage using a key-to-address transformation to assign records to addresses is considered. The file is assumed to be in steady state, that is that the rates of additions to and of deletions from the file are equal. The loading factors that minimize file maintenance costs in terms of storage space and additional accesses are computed for different buc...
متن کاملOverflow Probability of Variable-length Codes with Codeword Cost
Lossless variable-length source coding with codeword cost is considered for general sources. The problem setting, where we impose on unequal costs on code symbols, is called the variablelength coding with codeword cost. In this problem, the infimum of average codeword cost have been determined for general sources. On the other hand, overflow probability, which is defined as the probability of c...
متن کاملUniversal coding with minimum probability of codeword length overflow
-Lossless block-to-variable length source coding is studied for finite-state, finite-alphabet sources. We aim to minimize the probability that the normalized length of the codeword will exceed a given threshold B, subject to the Kraft inequality. It is shown that the Lempel-Ziv (LZ) algorithm asymptotically attains the optimal performance in the sense just defined, independently of the source a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Syst.
دوره 14 شماره
صفحات -
تاریخ انتشار 1989