Patent ReferencesB-tree structured data base using sparse array bit maps to store inverted lists Method of compacting and searching a data index Apparatus for rotating a dot matrix pattern by 90 degrees Method and apparatus for encoding, decoding and transmitting data in compressed form Method and apparatus for representing and interrogating an index in a digital memory System for searching a data base by creating a marking matrix in which two dimensional patterns control the search and selection Database index design based upon request importance and the reuse and modification of similar existing indexes Dynamic index retrieval, bit mapping, and optimization of a single relation access Method and apparatus for indexing database columns with bit vectors Patent #: 5649181 InventorsAssigneeApplicationNo. 570183 filed on 12/11/1995US Classes:707/2, Access augmentation or optimizing705/35, Finance (e.g., banking, investment or credit)707/3, Query processing (i.e., searching)707/10, Distributed or remote access707/205, File allocation711/100, STORAGE ACCESSING AND CONTROL711/171Based on data sizeExaminersPrimary: Black, Thomas G.Assistant: Alam, Hosain T. Attorney, Agent or FirmInternational ClassG06F 017/30AbstractA Client/Server Database System with improved methods for performing database queries, particularly DSS-type queries, is described. The system includes one or more Clients (e.g., Terminals or PCs) connected via a Network to a Server. In general operation, Clients store data in and retrieve data from one or more database tables resident on the Server by submitting SQL commands, some of which specify "queries"--criteria for selecting particular records of a table. The system implements methods for storing data vertically (i.e., by column), instead of horizontally (i.e., by row) as is traditionally done. Each column comprises a plurality of "cells" (i.e., column value for a record), which are arranged on a data page in a contiguous fashion. By storing data in a column-wise basis, the system can process a DSS query by bringing in only those columns of data which are of interest. Instead of retrieving row-based data pages consisting of information which is largely not of interest to a query, column-based pages can be retrieved consisting of information which is mostly, if not completely, of interest to the query. The retrieval itself can be done using more-efficient large block I/O transfers. The system includes data compression which is provided at the level of Cache or Buffer Managers, thus providing on-the-fly data compression in a manner which is transparent to each object. Since vertical storage of data leads to high repetition on a given data page, the system provides improved compression/decompression.Other References
| |