Data relationships processor with unlimited expansion capability

Boots – shoes – and leggings

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

364DIG7, 3642821, 3642822, 3642823, 3642831, 3642834, G06F 100, G06F 1500

Patent

active

056048998

ABSTRACT:
Machine automated techniques are described for a method of data processing called Relationships Processing. A computing system is disclosed which provides for the high speed recording and extraction of data objects (entities) and for the development data representing a queried relationship between the entities. The system is expandable to handle the relatively voluminous data bases of large, commercial data repositories.
A user defines set of entities and allowed relationships between the entities. The user can expand this set of allowed entities and relationships at any time during the life of the system without reprogramming or compiling of computer program code or disrupting concurrent operational use of the system. Large systems can now be built that are no longer limited to a scope of design requirements known during initial systems development. For a given set of defined relationships the system allows the user to perform complex inquiries (again without programming at the code level) that would normally require multiple nested inquiries to be coded programmatically and would not achieve the performance levels of the Relationships Processor.

REFERENCES:
patent: 3618027 (1971-11-01), Feng
patent: 3670310 (1972-06-01), Bharwani et al.
patent: 4128891 (1978-12-01), Lin et al.
patent: 4497039 (1985-01-01), Kitakami et al.
patent: 4498145 (1985-02-01), Baker et al.
patent: 4575798 (1986-03-01), Lindstrom et al.
patent: 4631664 (1986-12-01), Bachman
patent: 4670848 (1987-06-01), Schramm
patent: 4791561 (1988-12-01), Huber
patent: 4807122 (1989-02-01), Baba
patent: 4829427 (1989-05-01), Green
patent: 4893232 (1990-01-01), Saimaoka et al.
patent: 4901229 (1990-02-01), Tashiro et al.
patent: 4918593 (1990-04-01), Huber
patent: 4930071 (1990-05-01), Tou et al.
patent: 4930072 (1990-05-01), Agrawal et al.
patent: 4967341 (1990-10-01), Yamamoto et al.
patent: 5133068 (1992-07-01), Crus et al.
patent: 5168565 (1992-12-01), Morita
patent: 5239663 (1993-08-01), Faudemay
Korth and Silberschatz, Database System Concepts, McGraw-Hill Book Company (New York, 1986),pp. 45-105; pp. 301-323.
"Extended Disjunctive Normal Form for Efficient Processing of Recursive Logic Queries", IBM Technical Disclosure Bulletin, vol. 30 No. 1, Jun. 1987 pp. 360-366.
Yu et al, "Automatic Knowledge Acquisition and Maintenance For Semantic Query Optimization", IEEE Transactions on Knowledge and Data Engrn, V:l, No. 3 Sep. 1989, pp. 362-375.
Kifer et al, "Sygraf: Implementing Logic Programs in a Database Style" IEEE Transactions on Software Engnrn. v:14, N7, Jul. 1988 pp. 92-935.
El-Sharkawi et al, "The Architecture and Implementation of Enli: An Example-Based Natural Language Assisted Interface", Parbase 90 Intl. Conf. on Databases, Parallel Architectures & Their Applications, 7-9 Mar. 1990.
Wilschut et al, "Pipelining in Query Execution" Parbase-90 Intl. Conf. on Databases, Parallel Architectures and Their Applications, 7-9 Mar. 1990 p. 562.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Data relationships processor with unlimited expansion capability does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Data relationships processor with unlimited expansion capability, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Data relationships processor with unlimited expansion capability will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-1608981

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.