Data exploration system and method

• US 6,601,058 B2
• Filed: 10/05/1998
• Issued: 07/29/2003
• Est. Priority Date: 10/05/1998
• Status: Expired due to Term

• Current Assignee: Serena Software, Inc. (Open Text Corporation)
• Original Assignee: Merant Inc.
• Inventors: Forster, Michael, Spratt, Lindsay
• Primary Examiner(s): Alam, Hosain T.
• Application Number:
  US09/166,556
• Publication Number:
  US 20020083049A1
• Time in Patent Office: 1,758 Days
• Field of Search: 707/1-4, 707/102-103, 706/10-11, 706/13, 706/50-54, 706/60-62, 706/77, 706/46, 706/59
• US Class Current: 1/1
• CPC Class Codes: G06F 16/20 of structured data, e.g. relational data
• CPC Class Codes: Y10S 707/99932 Access augmentation or optimizing
• CPC Class Codes: Y10S 707/99933 Query processing, i.e. searching

Abstract

Preferred embodiments of the invention provide a system for, and method of, exploring relationships in data stored in a computer readable medium. A query is received having at least one operator chosen from a set of operators that includes relational operators and having at least one input and output associated with the operator and defined as a table having at least one domain having a type associated therewith. The query is transformed into a set program having at least one operation structure, corresponding to the operator and having logic for type-independently performing an operation, corresponding to the operator, and having a data relation structure, cooperating with the operation structure, for handling all data access and storage associated with the operation.

Claims

1. A system for exploring relationships in data stored in a computer readable medium, comprising:

first logic to receive a query having at least one operator chosen from a set of operators that includes relational operators and non-relational operators having zero or more inputs or zero or more outputs associated with the operator and defined as at least one non-relational table having at least one domain having a type associated therewith, the table comprising zero or more rows in an expressed sequential order; and

second logic to transform the query into a set program having at least one operation structure, corresponding to the operator and having logic for type-independently and without inherent meaning performing an operation, corresponding to the operator, and having a data relation structure, cooperating with the operation structure, for handling all data access and storage associated with the operation.

2. The system of claim 1 wherein the data relation structure has conversion logic for converting input data from one type to a second type so that the data of the second type may be manipulated by the operation performing logic.

3. The system of claim 1 wherein the data relation structure has conversion logic for converting input data from one type to a second type so that the data of the second type may be compared by the operation performing logic.

4. The system of claim 1 wherein the data relation structure has logic for directly accessing input and output data without an access method.

5. The system of claim 1 wherein the set of operators includes operators for defining parameterized queries and wherein the second logic includes logic to instantiate a parameterized query.

6. The system of claim 1 where in the second logic includes logic to detect implied operations in a query and to inject at least one operation structure into the set program to express a detected, implied operation.

7. The system of claim 6 wherein the logic to detect implied operations includes logic to detect at least one of columns within a table, columns of different tables, and scalar values.

8. The system of claim 1 wherein the set of operators includes operators to express a recursive query and wherein the second logic includes logic to control recursive execution of a query.

9. A system for exploring relationships in data stored in a computer readable medium, comprising:

means for receiving a query having at least one operator chosen from a set of operators that includes relational operators and non-relational operators having zero or more inputs or zero or more outputs associated with the operator and defined as at least one non-relational table having at least one domain having a type associated therewith, the table comprising zero or more rows in an expressed sequential order; and

means for transforming the query into a set program having at least one operation structure, corresponding to the operator and having means for type-independently and without inherent meaning performing an operation, corresponding to the operator, and having a data relation structure, cooperating with the operation structure, for handling all data access and storage associated with the operation.

10. The system of claim 9 wherein the data relation structure has means for converting input data from one type to a second type so that the data of the second type may be manipulated by the operation performing means.

11. The system of claim 9 wherein the data relation structure has means for converting input data from one type to a second type so that the data of the second type may be compared by the operation performing means.

12. The system of claim 9 wherein the data relation structure has means for directly accessing input and output data without an access method.

13. The system of claim 9 wherein the set of operators includes operators for defining parameterized queries and wherein the transforming means includes means for instantiating a parameterized query.

14. The system of claim 9 wherein the transforming means includes means for detecting implied operations in a query and to inject at least one operation structure into the set program to express a detected, implied operation.

15. The system of claim 14 wherein the detecting means includes logic to detect at least one of columns within a table, columns of different tables, and scalar values.

16. The system of claim 9 wherein the set of operators includes operators to express a recursive query and wherein the transforming means includes means for controlling recursive execution of a query.

17. A method of exploring relationships in data stored in a computer readable medium, comprising:

receiving a query having at least one operator chosen from a set of operators that includes relational operators and non-relational operators having zero or more inputs or zero or more outputs associated with the operator and defined as a non-relational table having at least one domain having a type associated therewith, the table comprising zero or more rows in an expressed sequential order; and

transforming the query into a set program having at least one operation structure, corresponding to the operator and having logic to type-independently and without inherent meaning perform an operation, corresponding to the operator, and having a data relation structure, cooperating with the operation structure, for handling all data access and storage associated with the operation.

18. The method of claim 17 further including executing the set program wherein the data relation structure converts input data from one type to a second type so that the data of the second type may be manipulated by the operation performing logic.

19. The method of claim 17 further including executing the set program wherein the data relation structure has means for converting input data from one type to a second type so that the data of the second type may be compared by the operation performing logic.

20. The method of claim 17 further including executing the set program wherein the data relation structure directly accesses input and output data without an access method.

21. The method of claim 17 wherein the set of operators includes operators for defining parametrized queries and wherein the method further includes executing the set program and consequently instantiating a parameterized query.

22. The method of claim 17 wherein transforming the query includes detecting implied operations in a query and injecting at least one operation structure into the set program to express a detected, implied operation.

23. The method of claim 22 wherein detecting implied operations includes detecting at least one of one of columns within a set, columns of different tables, and scalar values.

24. The method of claim 17 wherein the set of operators includes operators to express a recursive query and wherein the method further includes executing the set program and consequently controlling recursive execution of a query.