Heirarchical indexing of multi-attribute data by sorting, dividing and storing subsets
May 29, 2019. 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 ReferencesMethod for accessing a database with multi-dimensional search tree nodes Method for high-dimensionality indexing in a multi-media database Computer data storage management system and methods of indexing a dataspace and searching a computer memory Method of clustering multi-dimensional related data in a computer database by combining the two verticles of a graph connected by an edge having the highest score Computer method and storage structure for storing and accessing multidimensional data System and method for construction of a data structure for indexing multidimensional objects Relational database modifications based on multi-dimensional database modifications Relational emulation of a multi-dimensional database Sparsity management system for multi-dimensional databases Method and apparatus for implementing a hierarchical database management system (HDBMS) using a relational database management system (RDBMS) as the implementing apparatus InventorsApplicationNo. 322901 filed on 05/29/1999US Classes:707/100, DATABASE SCHEMA OR DATA STRUCTURE707/2, Access augmentation or optimizing707/4, Query formulation, input preparation, or translation707/7, Sorting707/102Generating database or data structure (e.g., via user interface)ExaminersPrimary: Breene, JohnAssistant: Channavajjala, Srirama Attorney, Agent or FirmForeign Patent References
International ClassG06F 017/30AbstractA system and method for indexing and storing multi-dimensional or multi-attribute data. Data items are recursively sorted in a selected dimension (e.g., the dimension having the greatest variance) and divided until each subdivision fits into a leaf node having a specified fanout. Intermediate nodes and a root node are constructed to complete the index. Each node of the index is stored in a database as a separate object or record and may include a node identifier of the unique, an identifier of a parent and/or a sibling node and an entry for each child of the node, which may be data items or other nodes. Each record entry for a child includes an associated bounding area encompassing descendant data items. Another database table or module may store information about the index, such as the dimensionality of the data, the index fanout and an identifier of a root of the index.Other References
Field of SearchDATABASE OR FILE ACCESSINGAccess augmentation or optimizing Query processing (i.e., searching) Query formulation, input preparation, or translation Query augmenting and refining (e.g., inexact access) Pattern matching access Sorting Concurrency (e.g., lock management in shared database) Distributed or remote access Manipulating data structure (e.g., compression, compaction, compilation) DATABASE SCHEMA OR DATA STRUCTURE Application of database or data structure (e.g., distributed, multimedia, image) Object-oriented database structure Generating database or data structure (e.g., via user interface) Object-oriented database structure network Object-oriented database structure reference Object-oriented database structure processing FILE OR DATABASE MAINTENANCE Coherency (e.g., same view to multiple users) Recoverability Version management Archiving or backup File allocation DISTRIBUTED DATA PROCESSING COMPUTER CONFERENCING Cooperative computer processing Initializing COMPUTER NETWORK MANAGING | |
