Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
2001-09-10
2004-04-13
Rones, Charles (Department: 2175)
Data processing: database and file management or data structures
Database design
Data structure types
C707S793000, C382S156000
Reexamination Certificate
active
06721757
ABSTRACT:
BACKGROUND OF THE INVENTION
1. Field of the Invention
The present invention discloses a method and apparatus for data organization, storage, retrieval and processing, that eliminates locational, structural or associative limitations.
2. Description of Related Art
Currently, information organization is implemented using many methodologies, which often serve different and distinct purposes for different general kinds of information. If the information is composed of specific facts, figures, names, and relationships, then the current approach forces each specific application to provide its own way of defining and using records. The only process who can possibly know what the information is, is the one application which creates/maintains that kind of information. At the lower OS level, data can be any type as far as a database or any other application is concerned. So files and directories are used to organize information, where physical and logical organizations of information are one and the same.
To find qualified and desired information, a process must first deal with files and directories. The process must incorporate and reflect the physical directory and file hierarchy into its logical information organization. Many current containment shells such as WINDOWS and DESQVIEW, attempt to provide a seamless gap between the OS and applications, so that a process does not have to deal with OS details. Aside from being unstable, such shells are still constricted by containment. That is, the logical and physical organizations of information become the same at some level. That is the level at which logical expansions, reorganizations, and further associations become impossible for containment.
SUMMARY OF THE INVENTION
To overcome the limitations in the prior art described above, and to overcome other limitations that will become apparent upon reading and understanding the present specification, the present invention discloses a computer-implemented method and apparatus for information organization, wherein atomic information can be both static and dynamic, but the compound information (e.g., associations, groupings, sets, etc.) of such atoms always remain dynamic. Unless otherwise directed, a compound information entity is always dynamically determined and generated. This determination is based on the processing of a defined condition, wherein all atoms qualifying the condition are included in the compound. This dynamic determination eliminates the need to “update” the compound, when atoms and/or compounds common to two or more compounds are changed. Further, each information compound can be dynamically generated based on an existing definition for that compound.
REFERENCES:
patent: 4791561 (1988-12-01), Huber
patent: 4805099 (1989-02-01), Huber
patent: 5093782 (1992-03-01), Muraski et al.
patent: 5123057 (1992-06-01), Verly et al.
patent: 5129083 (1992-07-01), Cutler et al.
patent: 5133070 (1992-07-01), Barker
patent: 5241645 (1993-08-01), Cimral et al.
patent: 5418942 (1995-05-01), Krawchuk et al.
patent: 5454101 (1995-09-01), Mackay et al.
patent: 5463774 (1995-10-01), Jenness
patent: 5504892 (1996-04-01), Atsatt et al.
patent: 5535383 (1996-07-01), Gower
patent: 5535386 (1996-07-01), Wang
patent: 5548749 (1996-08-01), Kroenke et al.
patent: 5551028 (1996-08-01), Voll et al.
patent: 5608900 (1997-03-01), Dockter et al.
patent: 5652880 (1997-07-01), Seagraves
patent: 5684985 (1997-11-01), Ahmadi
patent: 5692184 (1997-11-01), Ardoin et al.
patent: 5729738 (1998-03-01), Watanabe et al.
patent: 5758344 (1998-05-01), Prasad et al.
patent: 5781906 (1998-07-01), Aggarwal et al.
patent: 5787432 (1998-07-01), LeTourneau
patent: 5838965 (1998-11-01), Kavanagh et al.
patent: 5905987 (1999-05-01), Shutt et al.
patent: 5924094 (1999-07-01), Sutter
patent: 5960437 (1999-09-01), Krawchuk et al.
patent: 5991765 (1999-11-01), Vethe
patent: 5999926 (1999-12-01), Suciu
patent: 6009434 (1999-12-01), Chui et al.
patent: 6018741 (2000-01-01), Howland et al.
patent: 6052686 (2000-04-01), Fernandez et al.
patent: 6052688 (2000-04-01), Thorsen
patent: 6052691 (2000-04-01), Ardoin et al.
patent: 6092064 (2000-07-01), Aggarwal et al.
patent: 6092077 (2000-07-01), Ahmadi
patent: 6154739 (2000-11-01), Wrobel
patent: 6189012 (2001-02-01), Mital et al.
patent: 6189138 (2001-02-01), Fowlow et al.
patent: 6208987 (2001-03-01), Nihei
patent: 6208989 (2001-03-01), Dockter et al.
patent: 6219662 (2001-04-01), Fuh et al.
patent: 6240407 (2001-05-01), Chang et al.
patent: 6247016 (2001-06-01), Rastogi et al.
patent: 6249788 (2001-06-01), Ronström
patent: 6253195 (2001-06-01), Hudis et al.
patent: 6278992 (2001-08-01), Curtis et al.
patent: 6278997 (2001-08-01), Agrawal et al.
patent: 6279016 (2001-08-01), De Vorchik et al.
patent: 6289354 (2001-09-01), Aggarwal et al.
patent: 6292804 (2001-09-01), Ardoin et al.
patent: 6311179 (2001-10-01), Agarwal et al.
patent: 6317749 (2001-11-01), Ghatate
patent: 2002/0032686 (2002-03-01), Ahmadi
patent: 2002/0073064 (2002-06-01), Ahmadi
patent: 2002/0124008 (2002-09-01), Ahmadi
Agrawal, R. et al., “An Interval Classifier for Database Mining Applications”,Proceedings of the 18th International Conference on Very Large Data Bases, Vancouver, Canada, pp. 560-573 (Aug. 23-27, 1992).
Agrawal, R. et al., “Mining Association Rules between Sets of Items in Large Databases”,Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, Washington, D.C., pp. 207-216 (May 26-28, 1993).
Agrawal, R. et al., “Database Mining: A Performance Perspective”,IEEE Transactions on Knowledge and Data Engineering, vol. 5, No. 6, pp. 914-925 (Dec. 1993).
Batory, D.S. et al., “GENESIS: An Extensible Database Management System”,IEEE Transactions on Software Engineering, vol. 14, No. 11, pp. 1711-1730 (Nov. 1988).
Beckmann, N. et al., “The R*-tree: An Efficient and Robust Access Method for Points and Rectangles”,Proceedings of the 1990 ACM SIGMOD International Conference on Management of Data, Atlantic City, NJ, pp. 322-331 (May 23-25, 1990).
Belkin, N. et al., “Information Filtering and Information Retrieval: Two Sides of the Same Coin?”,Communications of the ACM, vol. 35, No. 12, pp. 29-38 (Dec. 1992).
Bhide, A. et al., “A Comparison of Two Approaches to Build Reliable Distributed File Servers”,11th International Conference on Distributed Computing Systems, Arlington, Texas, pp. 616-623 (May 20-24, 1991).
Blaha, M. et al., “Relational Database Design Using an Object-oriented Methodology”,Communications of the ACM, vol. 31, No. 4, pp. 414-427 (Apr. 1988).
Blizard, W., “Multiset Theory”,Notre Dame Journal of Formal Logicvol. 30, No. 1, pp. 36-66 (Winter 1989).
Brachman, R. et al., “An Overview of the KL-ONE Knowledge Representation System”,Cognitive Science, vol. 9, No. 2, pp. 171-216 (Apr.-Jun. 1985).
Codd, E.F., “Extending the Database Relational Model to Capture More Meaning”,ACM Transactions on Database Systemsvol. 4, No. 4, pp. 397-434 (Dec. 1979).
Conklin, J., “Hypertext: An Introduction and Survey”,Computer, vol. 20, No. 9, pp. 17-41 (Sep. 1987).
Consens, M. et al., “Optimizing Queries on Files”,SIGMOD RECORD. Proceedings of the 1984 ACM SIGMOD International Conference on Management of Data, Minneapolis, Minnesota,vol. 23, No. 2, pp. 301-312 (Jun. 1994).
Decorte, G. et al., “An Object-Oriented Model for Capturing Data Semantics”,Eighth International Conference on Data Engineering, Tempe, Arizona, pp. 126-135 (Feb. 23, 1992).
Dennes, A., “Stylizing Long Documents? FrameMaker 4.0 is for you”,P.C. Computing, pp. 16, 84 (Oct. 1993).
Drakopoulos, E. et al., “Performance Study of Client-Server Storage Systems”,Digest of Papers. Eleventh IEEE Symposium on Mass Storage Systems, Monterey, California, pp. 67-72 (Oct. 7-10, 1991).
Drakopoulos, E. et al., “Performance Analysis of Client-Server Storage Systems”,IEEE Transactions on Computers, vol. 41, No. 11, pp. 1442-1452 (Nov. 1992).
Edwards, D. et al., “Exploiting Read-Mostly Workloads in the FileNet File System”,Proceedings of the Twelfth ACM Symposium on Operating Sytems Principles, Litchfield Park, Arizona, pp. 58-70 (D
Merchant & Gould P.C.
Rones Charles
UFIL Unified Data Technologies Ltd.
LandOfFree
Method and apparatus for binary-oriented set sequencing does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method and apparatus for binary-oriented set sequencing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for binary-oriented set sequencing will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3235632