Compressed representation of a data base that permits AD HOC querying
May 8, 2017. Estimated Expiration Date is calculated based on simple USPTO term provisions. It does not account for terminal disclaimers, term adjustments, failure to pay maintenance fees, or other factors which might affect the term of a patent.Patent ReferencesDatabase system with multi-dimensional summary search tree nodes for reducing the necessity to access records Data search and compression device and method for searching and compressing repeating data Indexing/compression scheme for supporting graphics and data selection Data compression system and method representing records as differences between sorted domain ordinals representing field values Method and system for searching compressed data Method for sampling a compressed index to create a summarized index Method and apparatus for an ulnar collateral ligament thumb support Apparatus and method for searching through compressed, structured documents Patent #: 5812999 InventorsAssigneeApplicationNo. 848454 filed on 05/08/1997US Classes:707/101, Manipulating data structure (e.g., compression, compaction, compilation)707/1, DATABASE OR FILE ACCESSING707/2, Access augmentation or optimizing707/3, Query processing (i.e., searching)707/100DATABASE SCHEMA OR DATA STRUCTUREExaminersPrimary: Kulik, Paul V.Assistant: Robinson, Greta Foreign Patent References
International ClassG06F 017/30AbstractA method and system for compressing a data base that permits queries on the compressed representation of the data base. Another feature is that an approximation of the values of the data base are derivable directly from the compressed representation of the data base. Yet another feature is correction of poor approximations of the reconstructed data. Still another feature is the capability of performing aggregate queries of the compressed representation of the data base. | |
