Patent
Database query system and method
Arnold N. Blinn,Michael Lorton +1 more
- 01 Jun 1998
21
TL;DR: In this paper, a page definition table has a plurality of entries, each indicating pairs of key values, and the server responds by identifying an entry from the page definition tables that corresponds to the search value, and then identifies a set of database records whose key values are bounded by the pair of key value of the identified entry.
read more
Abstract: The invention includes an information retrieval system having a server and a plurality of clients. The server has access to one or more data storage media on which the server maintains a database. The database has a plurality of records that can be searched based on key values. The server maintains a page definition table in addition to the database. The page definition table has a plurality of entries, each indicating pairs of key values. To perform an information search, a client submits a search value to the server. The server responds by identifying an entry from the page definition table that corresponds to the search value. The server then identifies a set of database records whose key values are bounded by the pair of key values of the identified entry. Data from these database records are returned as search results to the client.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Patent
Unit of work based incremental data processing
John K. Rees,Rohit Chaturvedi +1 more
- 20 Jan 2014
TL;DR: In this paper, a method for selecting a unit of work key for a program that processes records in a source table is described, such that modifications to a record having a certain unit-of-work key value will not affect the program's processing of records having a different value.
1
References
Patent
Range-based query optimizer
Gennady Antoshenkov
- 19 Jul 1994
TL;DR: In this article, a query is composed as ranges of record values related by logical operators, and the query is converted to a Boolean tree in canonical form, which is optimized to express the ranges as a set of disjoint semi-open ranges.
260
Patent
Computer data storage management system and methods of indexing a dataspace and searching a computer memory
Freeston Michael William
- 01 Jul 1994
TL;DR: In this article, the authors propose a hierarchical data structure for multi-dimensional information databases, in which the index nodes are arranged in an index tree structure, and when extra information inserted into the memory results in index node overflow, the index node is split and, in certain specified circumstances, an index entry will become disposed at a level higher than the hierarchical level to which it corresponds.
224
Patent
Data base optimizer using most frequency values statistics
Akira Shibamiya,Melvin Richard Zimowski +1 more
- 02 Sep 1988
TL;DR: In this article, a method for more accurately estimating the time required to process a data base query using a selected index is presented. But this method assumes that the query's search criteria specify values other than the stored most frequently occurring values, those values are assumed to be uniformly distributed.
144
Patent
Concurrency-control method and apparatus in a database management system utilizing key-valued locking
David B. Lomet,Russell J. Green +1 more
- 05 Feb 1993
TL;DR: In this article, the concurrency control mechanisms in a database management system achieves high concurrency by using a lock-mode set larger than that conventionally employed for multi-granularity locking.
129
Patent
Storage and retrieval of ordered sets of keys in a compact 0-complete tree
Jean A. Marquis
- 18 Nov 1996
TL;DR: In this paper, a B-tree-like search algorithm for indexing and accessing data stored in the computer storage system, comprising a compact multi-way search tree structure, is presented.
86