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 Bit string compressor with boolean operation processing capability Method and apparatus for encoding, decoding and transmitting data in compressed form Relational data base memory utilization analyzer 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 Method and apparatus for data storage and interchange using a relational database table, and a data record for use in connection therewith InventorsAssigneeApplicationNo. 820864 filed on 03/20/1997US Classes:707/3, Query processing (i.e., searching)707/1, DATABASE OR FILE ACCESSING707/4, Query formulation, input preparation, or translation707/10, Distributed or remote access707/101Manipulating data structure (e.g., compression, compaction, compilation)ExaminersPrimary: Black, Thomas G.Assistant: Mizrahi, Diane D. 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. The system builds the value lookup table for tracking unique values in the cells. As additional unique values are inserted into the column of the user's table (i.e., maintained as the row-ordered cell array), the system assigns a small unique integer value to each unique user value. Instead of storing the original (wide) data value into the row-ordered array, the system instead stores the new (narrow) integer number into the row-ordered array. In response to a user request to retrieve a value for a given row number, the system fetches the appropriate chunk of the row-ordered array and retrieves the small integer value. This small integer value is then used to index into the value lookup table, for reconstituting the actual user data.Other References
Field of SearchDATABASE OR FILE ACCESSINGQuery processing (i.e., searching) Query formulation, input preparation, or translation Manipulating data structure (e.g., compression, compaction, compilation) Reservation, check-in, or booking display for reserved space Trading, matching, or bidding Addressing cache memories Plural amplifier channels WITH PLURAL AMPLIFIER CHANNELS (E.G., PARALLEL AMPLIFIER CHANNELS) WITH AMPLIFIER BYPASS MEANS (E.G., FORWARD FEED) With antenna feed network or multiple antenna switching Battery charging | |