J. Li, D. Rotem and H. Wong, A New Compression Method with Fast Searching on Large Data Bases, Proc. Int'l. Conf. on Very Large Data Bases, Brighton, England, August 1987, 311. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Data Compression and Database Performance - Graefe, Shapiro (1991) (13 citations) (Correct)
.... that allow search (selection) on compressed data [13] Cormack discusses compression of entire records (not fields) in the IMS database management system [6] Other researchers have investigated compression and access schemes for scientific databases with very many constants (e.g. zeroes) [9, 19, 21] and considered a very special operation on compressed data (matrix transposition) 31] For indices, many database systems use prefix and postfix truncation to save space and increase the fan out of nodes, e.g. Starburst [15] However, actual compression methods are typically not used at all in ....
J. Li, D. Rotem and H. Wong, A New Compression Method with Fast Searching on Large Data Bases, Proc. Int'l. Conf. on Very Large Data Bases, Brighton, England, August 1987, 311.
Block-Oriented Compression Techniques for Large Statistical.. - Ng, Ravishankar (1995) (9 citations) (Correct)
.... Delta Delta Figure 6.1: Census records. for many of the attribute values. This results in higher repetitions of zeroes, thus yielding higher compression ratio. 6 Related Work Several techniques have been proposed for compressing statistical databases [1, 5, 7, 8, 9, 14, 21]. We will only discuss some of the more relevant work, particularly work on statistical databases with flat file structures, attribute transpositions and Huffman coding. The reader is referred to two survey papers on database compression by Bassiouni [2] and Severance [22] for more complete and ....
....work, particularly work on statistical databases with flat file structures, attribute transpositions and Huffman coding. The reader is referred to two survey papers on database compression by Bassiouni [2] and Severance [22] for more complete and detailed exposition. 6. 1 Constants Removal In [8, 9, 14], the authors are concerned with statistical databases that assume a flat file structure, i.e. those consisting of one or more sequential file(s) of bytes. Such databases usually contain numeric data, say from the results of laboratory experiments, monitoring of seismic activities, or business ....
J. Z. Li, D. Rotem, H. K. T. Wong. A New Compression Method with Fast Searching on Large Databases. Proceedings of the 13th International Conference on Very Large Data Bases, pp. 311--318, 1987.
Efficiently Supporting Ad Hoc Queries in Large Datasets.. - Korn, Jagadish.. (1997) (28 citations) (Correct)
....computation of SVDD with only three passes over the matrix. No previous work, to our knowledge, has addressed the problem we study in this paper, even though work on data compression abounds. Some interesting work has been done on compression with fast searching in a large database of bit vectors [12, 5]. Our work is different because our focus is on a dataset of real valued numbers rather than bit vectors. Well designed index structures are necessary to support ad hoc queries. There has been much work on index structures, including some excellent recent work specifically aimed at decision ....
J. Li, D. Rotem, and H. Wong. A new compression method with fast searching on large databases. In Proceedings of the 13th VLDB Conference, volume 13, pages 311--318, Brighton, England, 1987.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC