US 7,028,037 B1Grant
Operators for accessing hierarchical data in a relational system
Issue Date:2006-04-11
•21 Claims
•5 Drawing Sheets
Abstract
Techniques and systems are provided for efficiently managing hierarchical relational data stored in object-relational database system by extending the syntax of the database language supported by the database system (e.g. SQL) to incorporate several new “hierarchical” operators. These operators are evaluated based on the hierarchical relationship defined for hierarchical relational data. The operators maybe incorporated in SQL queries along with relational operators.
Metadata
Assignee
- Oracle International Corporation
Inventors
- Nipun Agarwal
- Ravi Murthy
- Eric Sedlar
- Sivasankaran Chandrasekar
- Fei Ge
Application Information
Application Number:US 10/260,138
Filing Date:2002-09-27
Priority Date:2001-09-28
Art Unit:2165
Classifications
IPC:
G06F7/00G06F17/00
Patent Drawings (5 sheets)
Description
RELATED APPLICATIONS
[0001] The present application claims priority from the following U.S. Provisional Patent Applications, the entire contents of which are incorporated herein by reference for all purposes:
[0002] U.S. Provisional Patent Application No. 60/326,052, filed on Sep. 28, 2001, entitled FILE BASED ACCESS PROVIDED WITH A DATABASE SYSTEM, by ERIC SEDLAR and VISWANATHAN KRISHNAMURTHY;
[0003] U.S. Provisional Patent Application No. 60/378,800, filed on May 7, 2002, entitled SQL ACCESS TO DATA THAT PROVIDES A FILE SYSTEM ABSTRACTION, by NIPUN AGARWAL, RAVI MURTHY, ERIC SEDLAR, SIVASANKARAN CHANDRASEKAR, FEI GE, SYAM PANNALA, NEEMA JALALI and MURALIDHAR KRISHNAPRASAD.
[0004] The present application is also related to the following U.S. patent applications, the entire contents of which are incorporated herein by reference for all purposes:
[0005] U.S. patent application Ser. No. 10/260,384, filed on Sep. 27, 2002, entitled PROVIDING A CONSISTENT HIERARCHICAL ABSTRACTION OF RELATIONAL DATA, by NIPUN AGARWAL, ERIC SEDLAR, RAVI MURTHY and NAMIT JAIN;
[0006] U.S. patent application Ser. No. 10/259,278, filed on Sep. 27, 2002, entitled MECHANISM FOR MAPPING XML SCHEMAS TO OBJECT-RELATIONAL DATABASE SYSTEMS, by RAVI MURTHY, MURALIDHAR KRISHNAPRASAD, SIVASANKARAN CHANDRASEKAR, ERIC SEDLAR, VISWANATHAN KRISHNAMURTHY and NIPUN AGARWAL;
[0007] U.S. patent application Ser. No. 10/260,161, filed on Sep. 27, 2002, entitled INDEXING TO EFFICIENTLY MANAGE VERSIONED DATA IN A DATABASE SYSTEM, by NIPUN AGARWAL, ERIC SEDLAR and RAVI MURTHY;
[0008] U.S. patent application Ser. No. 10/256,524, filed on Sep. 27, 2002, entitled MECHANISMS FOR STORING CONTENT AND PROPERTIES OF HIERARCHICALLY ORGANIZED RESOURCES, by RAVI MURTHY, ERIC SEDLAR, NIPUN AGARWAL, and NEEMA JALALI;
[0009] U.S. patent application Ser. No. 10/259,176, filed on Sep. 27, 2002, entitled MECHANISM FOR UNIFORM ACCESS CONTROL IN A DATABASE SYSTEM, by RAVI MURTHY, ERIC SEDLAR, NIPUN AGARWAL, SAM IDICULA and NICK MONTOYA;
[0010] U.S. patent application Ser. No. 10/256,777, filed on Sep. 27, 2002, entitled LOADABLE UNITS FOR LAZY MANIFESTATION OF XML DOCUMENTS by SYAM PANNALA, ERIC SEDLAR, BHUSHAN KHALADKAR, RAVI MURTHY, SIVASANKARAN CHANDRASEKAR, and NIPUN AGARWAL;
[0011] U.S. patent application Ser. No. 10/260,381, filed on Sep. 27, 2002, entitled MECHANISM TO EFFICIENTLY INDEX STRUCTURED DATA THAT PROVIDES HIERARCHICAL ACCESS IN A RELATIONAL DATABASE SYSTEM, by NEEMA JALALI, ERIC SEDLAR, NIPUN AGARWAL, and RAVI MURTHY;
FIELD OF THE INVENTION
[0012] The present invention relates to relational database systems and, more specifically, to techniques for managing hierarchical data within relational database systems.
BACKGROUND OF THE INVENTION
[0013] Humans tend to organize information in categories. The categories in which information is organized are themselves typically organized relative to each other in some form of hierarchy. For example, an individual animal belongs to a species, the species belongs to a genus, the genus belongs to a family, the family belongs to an order, and the order belongs to a class.
[0014] With the advent of computer systems, techniques for storing electronic information have been developed that largely reflected this human desire for hierarchical organization. Conventional computer file systems, for example, are typically implemented using hierarchy-based organization principles. Specifically, a typical file system has directories arranged in a hierarchy, and documents stored in the directories. Ideally, the hierarchical relationships between the directories reflect some intuitive relationship between the meanings that have been assigned to the directories. Similarly, it is ideal for each document to be stored in a directory based on some intuitive relationship between the contents of the document and the meaning assigned to the directory in which the document is stored.
[0015] FIG. 1 shows an example of a typical file system. The illustrated file system includes numerous directories arranged in a hierarchy. Two documents 118 and 122 are stored in the directories. Specifically, documents 118 and 122, both of which are entitled “Example.doc”, are respectively stored in directories 116 and 124, which are respectively entitled “Word” and “App4”.
[0016] In the directory hierarchy, directory 116 is a child of directory 114 entitled “Windows”, and directory 114 is a child of directory 110. Similarly, directory 124 is a child of directory 126 entitled “VMS”, and directory 126 is a child of directory 110. Directory 110 is referred to as the “root” directory because it is the directory from which all other directories descend. In many systems, the symbol “/” is used to refer to the root directory.
[0017] When electronic information is organized in a hierarchy, each item of information may be located by following a “path” through the hierarchy to the entity that contains the item. Within a hierarchical file system, the path to an item begins at the root directory and proceeds down the hierarchy of directories to eventually arrive at the directory that contains the item of interest. For example, the path to file 118 consists of directories 110, 114 and 116, in that order.
[0018] Hierarchical storage systems often allow different items to have the same name. For example, in the file system shown in FIG. 1 , both of the documents 118 and 122 are entitled “Example.doc”. Consequently, to unambiguously identify a given document, more than just the name of the document is required.
[0019] A convenient way to identify and locate a specific item of information stored in a hierarchical storage system is through the use of a “pathname”. A pathname is a concise way of uniquely identifying an item based on the path through the hierarchy to the item. A pathname is composed of a sequence of names. In the context of a file system, each name in the sequence of names is a “filename”. The term “filename” refers to both the names of directories and the names of documents, since both directories and documents are considered to be “files”.
[0020] Within a file system, the sequence of filenames in a given pathname begins with the name of the root directory, includes the names of all directories along the path from the root directory to the item of interest, and terminates in the name of the item of interest. Typically, the list of directories to traverse is concatenated together, with some kind of separator punctuation (e.g., ‘/’, ‘\’, or ‘;’) to make a pathname. Thus, the pathname for document 118 is /Windows/Word/Example.doc, while the pathname for document 122 is /VMS/App4/Example.doc.
[0021] The relationship between directories (files) and their contained content varies significantly between different types of hierarchically organized systems. One model, employed by various implementations, such as Windows and DOS file systems, requires each file to have exactly one parent, forming a tree. In a more complicated model, the hierarchy takes the form of a directed graph, where files can have multiple parents, as in the UNIX file system in which hard links are used.
[0022] In contrast to hierarchical approaches to organizing electronic information, a relational database stores information in tables comprised of rows and columns. Each row is identified by a unique RowID. Each column represents an attribute of a record, and each row represents a particular record. Data is retrieved from the database by submitting queries to a database management system (DBMS) that manages the database. The queries must conform to the database language supported by the database management system. Structured Query Language (SQL) is an example of a database language supported by many existing database management systems.
[0023] Each type of storage system has advantages and limitations. A hierarchically organized storage system is simple, intuitive, and easy to implement, and is a standard model used by most application programs. Unfortunately, the simplicity of the hierarchical organization does not provide the support required for complex data retrieval operations. For example, the contents of every directory may have to be inspected to retrieve all documents created on a particular day that have a particular filename. Since all directories must be searched, the hierarchical organization does nothing to facilitate the retrieval process.
[0024] A relational database system is well suited for storing large amounts of information and for accessing data in a very flexible manner. Relative to hierarchically organized systems, data that matches even complex search criteria may be easily and efficiently retrieved from a relational database system. However, the process of formulating and submitting queries to a database server is less intuitive than merely traversing a hierarchy of directories, and is beyond the technical comfort level of many computer users.
[0025] In the past, hierarchically organized systems and relationally organized systems have been implemented in different ways that were not compatible. With some additional processing, however, a relationally organized system can emulate a hierarchically organized system. This type of emulation is especially desirable when the storage capability and flexibility of a relational system is needed, but the intuitiveness and ubiquity of the hierarchical system is desired.
[0026] When hierarchically organized information is stored in a relational database system, the power of the relational system may be tapped by accessing the information using the access mechanism that is native to the relational database system. Specifically, using the database language supported by the database, complex queries can be formulated to extract the desired information from the database. However, the information that is of interest to a user may hinge on the position of the information within the applicable information hierarchy. Unfortunately, because database languages were designed based on the relational database model, the concept of hierarchical relationships is largely foreign to them. Consequently, it is desirable to provide a mechanism for querying information, stored within a relational database, based on the position of the information within the applicable hierarchy. It is further desirable to provide a mechanism for using queries to easily extract information about the position of information within the applicable information hierarchy.
SUMMARY OF THE INVENTION
[0027] Techniques and systems are provided for efficiently managing hierarchical relational data stored in object-relational database system by extending the syntax of the database language supported by the database system (e.g. SQL) to incorporate several new “hierarchical” operators. These operators are evaluated based on the hierarchical relationship defined for hierarchical relational data. The operators may be incorporated in SQL queries along with relational operators.
[0028] For example, assume rows of a table represent nodes in an XML tree. Each row is associated with a path for the node that corresponds to the row. An “UNDER_PATH” operator takes an argument that specifies a node in the hierarchy (the “input” node) and returns true for a row if the node associated with the row falls on or below the input node. The operator “PATH” returns the path to the node associated with a row. In one embodiment, if a query evaluates multiple hierarchical operators, such as “UNDER_PATH” and “PATH”, for the same rows, then the path only needs to be computed once for each row.
[0029] Another variation is the EQUALS_PATH operator that returns TRUE for a row if the node associated with the row is the same as the input node. Also, the operator RELATIVE_PATH returns the path to the node associated with a row, relative to the input node.
BRIEF DESCRIPTION OF THE DRAWINGS
[0030] The present invention is illustrated by way of example, and not by way of limitation, in the figures of the accompanying drawings and in which like reference numerals refer to similar elements and in which:
[0031] FIG. 1 is a block diagram illustrating a hierarchical file system;
[0032] FIG. 2 is a block diagram illustrating an information hierarchy;
[0033] FIG. 3 is a block diagram illustrating tables that may be used to capture the information hierarchy illustrated in FIG. 2 within a relational system according to an embodiment of the invention; and
[0034] FIG. 4 is a block diagram of a system on which embodiments of the invention may be implemented.
DETAILED DESCRIPTION OF THE INVENTION
[0035] A method and apparatus for accessing hierarchical information stored in a relational database system is described. In the following description, for the purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the present invention. It will be apparent, however, that the present invention may be practiced without these specific details. In other instances, well-known structures and devices are shown in block diagram form in order to avoid unnecessarily obscuring the present invention.
Functional Overview
[0036] Techniques are described herein for managing, within a relational database system, data items that belong to an information hierarchy. According to embodiments of the invention, the hierarchy to which the data items belong is not transparent to the database system. Rather, the database system explicitly recognizes and manages the hierarchy, and provides support for queries that access the data items based on the position of data items within the hierarchy. In one embodiment, the database language supported by the relational database system is extended to include operators that produce output based on the position of data items within that hierarchy. Such hierarchical operators may be used in conjunction with the many relational operators supported by relational database languages to formulate powerful queries to access the information in which users are interested. In one embodiment, the operators include a “PATH” operator and an “UNDER_PATH” operator, both of which shall be described in greater detail hereafter.
System Overview
[0037] FIG. 2 is a block diagram that illustrates a hierarchy 200 that is used in examples that are provided herein to facilitate an understanding of embodiments of the invention. Hierarchy 200 includes eight nodes. The highest node in the hierarchy is referred to as the “root” node. The nodes at the end of each branch in the hierarchy are “leaf” nodes. The nodes between the root node and the leaf nodes are “intermediate” nodes. In the illustrated hierarchy, nodes 1, 2, and 3 are intermediate nodes, and nodes 4, 5, 6, and 7 are leaf nodes.
[0038] In an information hierarchy, the nodes correspond to information. Typically, the piece of information associated with each node will have some form of name, and some type of content. For example, in a hierarchy that corresponds to a hierarchical file system, the nodes will typically correspond to files (where a “folder” or “directory” is one type of file). Each such file will have a name, and some form of contents.
[0039] Frequently, the names that are associated with the nodes in a hierarchy need not be unique. In the example shown in FIG. 2 , both node 1 and node 7 have the name “a”. Though they have the same name, they are separate and distinct nodes, which occupy different positions in the hierarchy and may be associated with completely different content.
[0040] FIG. 3 is a block diagram of two tables 302 and 350 that may be used to represent hierarchy 200 in a relational database system. Table 302 includes one row for each node in the hierarchy. The row for a given node includes the name associated with the given node and the data associated with the given node. For example, row 304 corresponds to node 1, and contains the name “a” and data 306 associated with node 1.
[0041] Table 350 includes one row for each of the parent-child relationships in hierarchy 200. A parent column 378 holds the value that specifies the parent in a parent-child relationship, and a child column 380 holds the value that specifies the child of the parent-child relationship. For example, row 352 indicates that the root node is the parent of node 1. Similarly, rows 354 and 356 respectively indicate that node 1 is the parent of nodes 2 and 3.
[0042] Tables 302 and 250, capture all the information of the hierarchy 200 in relational format. While embodiments of the invention shall be described hereafter through the use of examples that refer to hierarchy 200 and tables 302 and 350, such embodiments are merely exemplary. The way that a relational database system stores information about hierarchies may vary from implementation to implementation, and the present techniques are not limited to any particular implementation.
The UNDER_PATH Operator
[0043] According to one aspect of the invention, an “UNDER_PATH” hierarchical operator is provided to allow database statements to formulate explicit conditions related to whether nodes reside at or below a given node in a hierarchy. Specifically, in one embodiment, the UNDER_PATH operator has input parameters used to identify a node in the hierarchy. The node specified in the input parameters to the UNDER_PATH operator shall be referred to herein as the “input node”. The UNDER_PATH operator returns TRUE for all nodes that include the input node in their path up to the root node. Thus, the set of nodes that cause the UNDER_PATH operator to return TRUE are the “descendants” of the input node.
[0044] According to one embodiment, the UNDER_PATH operator can be invoked in any one of the following ways:
- [0045] INTEGER UNDER_PATH(resource_column, pathname)
- [0046] INTEGER UNDER_PATH(resource_column, depth, pathname)
- [0047] INTEGER UNDER_PATH(resource_column, pathname, correlation)
- [0048] INTEGER UNDER_PATH(resource_column, depth, pathname, correlation)
where the arguments are defined as follows: - [0049] resource_column: The column name or column alias of the ‘resource’ column
- [0050] pathname: The path name of the input node
- [0051] depth: The maximum depth to search.
- [0052] correlation: An integer that can be used to correlate the UNDER_PATH operator (a primary operator) with ancillary operators such as PATH and DEPTH.
[0053] For example, referring to hierarchy 200, the statement UNDER_PATH(node, ‘/a’), specifies node 1 as the input node for the UNDER_PATH operator. Similarly, the statement UNDER_PATH(node, ‘/a/c/a’) specifies node 7 as the input node for the UNDER_PATH operator.
[0054] When node 1 is specified as the input node to the UNDER_PATH operator, the UNDER_PATH operator returns “TRUE” for the rows that correspond to nodes 2, 3, 4, 5, 6 and 7. When node 3 is specified as the input node to the UNDER_PATH operator, the UNDER_PATH operator returns “TRUE” for the rows that correspond to nodes 6 and 7. When node 1 is specified as the input node to the UNDER_PATH operator and a maximum depth of 1 is specified, the UNDER_PATH operator returns “TRUE” for only the rows that correspond to nodes 2 and 3.
UNDER_PATH Processing
[0055] A database server that represents hierarchy 200 through the use of tables 302 and 350 may execute the UNDER_PATH operation by scanning table 350 X+1 times, where X equals the length of the longest chain, within hierarchy 200, between the input node and any leaf node. If a maximum depth is specified, then the number of scans performed is the lesser of X+1 and the specified depth.
[0056] For example, assume that the predicate of a query includes the expression UNDER_PATH(node, ‘/a’). Initially, the database server initializes a “matching set” that is to include the nodes for which UNDER_PATH(node, ‘/a’) evaluates to TRUE, and sets the matching set to NULL.
[0057] In the first pass, the database server scans table 350 to find the rows that have “1”, which corresponds to ‘/a’, in the parent column 378. In the present example, rows 354 and 356 include “1” in the parent column 378. From these rows, the database server adds the child nodes (2 and 3, respectively) to the matching set.
[0058] During each subsequent pass, the database server searches for rows that contain, in the parent column 378, the nodes that were added to the matching set in the previous pass. Thus, during the second pass, the database server searches for rows that have either 2 or 3 in the parent column 378. Rows 358 and 360 have 2 in the parent column 378, and rows 362 and 364 have 3 in the parent column 378. From rows 358, 360, 362 and 364 the database server respectively adds 4, 5, 6 and 7 to the matching set.
[0059] During the third pass, the database server searches for rows that contain nodes 4, 5, 6 or 7 in the parent column 378 (the nodes that were added to the matching set in the previous pass). None of the rows of table 350 have 4, 5, 6, or 7 in the parent column 378, so nothing is added to the matching set during the third pass. When a pass fails to add anything to the matching set, the matching set is complete and the UNDER_PATH expression is evaluated based on the members of the matching set. Specifically, the UNDER_PATH expression returns TRUE when applied to a row that corresponds to any member of the matching set, and FALSE when applied to rows that correspond to all other nodes.
[0060] According to alternative embodiment, the evaluation of the UNDER_PATH operator is performed more efficiently through the use of one or more indexes. For example, a hierarchical index, such as the index described in may be used to return the paths under a particular path. Such hierarchical indexes speed up access walking down a pathname. If the UNDER_PATH operator is used in the predicate of a query, and other parts of the query predicate are very selective, a functional implementation of UNDER_PATH may be chosen that will walk back up the hierarchy. Under these circumstances, walking up the hierarchy can be more efficient, since a much smaller number of links may need to be traversed.
The EQUALS_PATH Operator
[0061] According to one embodiment, an EQUALS_PATH operator is also provided. The EQUALS_PATH operator is defined as follows:
-
- [0062] EQUALS_PATH: INTEGER EQUALS_PATH(resource_column, pathname)
[0063] The EQUALS_PATH operator is functionally equivalent to UNDER_PATH with a depth restriction of zero. Thus, it returns TRUE when evaluated against the row associated with the input node, and returns FALSE when evaluated against all other rows.
The DEPTH Operator
[0064] According to one embodiment, a DEPTH operator is provided. The DEPTH operator is defined as follows:
-
- [0065] DEPTH: INTEGER DEPTH(correlation)
[0066] The DEPTH operator returns a number that indicates the depth, within the hierarchy, of the node associated with the row to which the operator is being applied. For example, when applied to the rows for nodes 1, 2, 3, 4, 5, 6 and 7 of hierarchy 200, the DEPTH operator returns the values 0, 1, 1, 2, 2, 2 and 2, respectively.
The PATH Operator
[0067] According to one aspect of the invention, a “PATH” hierarchical operator is provided. When applied to the row associated with a given node, the PATH operator produces a string made up of the names of the nodes that make up the chain that leads from the given node of the row up to the node specified by UNDER_PATH. The set of nodes identified in the string produced by applying the PATH operator to the row for a given node forms a relative path under the specified pathname in UNDER_PATH.
[0068] According to one embodiment, the PATH operator is defined as follows:
-
- [0069] PATH: VARCHAR2 PATH(correlation)
where VARCHAR2 represents a string type.
- [0069] PATH: VARCHAR2 PATH(correlation)
[0070] A database server that represents hierarchy 200 through the use of tables 302 and 350 may evaluate the PATH expression for the row associated with a node by scanning table 350 X times, where X equals the level, within hierarchy 200, of the node. According to one embodiment, the evaluation of PATH proceeds as follows:
[0071] Initially, to construct the PATH of a node, the database server creates a string that includes the name of the node associated with the row to which the PATH operator is being applied. For the purpose of explanation, it shall be assumed that the PATH operator is being applied to the row associated with node 5 of hierarchy 200. Thus, the database server initially creates the string “/e”.
[0072] After the initial string is created, the database server scans table 350 to identify the row in which 5 is the value of the child column 380. In the present example, the database server would locate row 360. From row 360, the database server would read that node 2 is the parent of node 5. From table 302, the database server would determine that the name of node 2 is “b”. Based on this information, the string “/b” is added to the string “/e” to create the string “/b/e”.
[0073] Once again the database server scans table 350, this time to identify the row that contains 2 in child column 380. In the present example, the database server would locate row 354. From row 354, the database server would read that node 1 is the parent of node 2. Table 302 indicates that “a” is the name of node 1. Node “a” is the root node, so the path construction operation is complete. Thus, the final result string is “/b/e”, which is relative to “/a”.
[0074] The process of scanning table 350 to find the parent to each new node that is added to the path is repeated until the input node is reached. Because the root node has no parent, the PATH string is complete when the root node is reached. In the present example, the string produced by applying the PATH operator to node 5 is “/b/e”.
Views
[0075] There are a variety of contexts in which hierarchical operators may be useful. Once such context is the definition of views. For example, a user may create a view (RV) of the hierarchical data based on the following view definition:
-
- [0076] RV: Select PATH from R$ where UNDER_PATH(root)=True;
[0077] In this example, R$ is table 302.
[0078] When executed, view RV produces one row for each node in hierarchy 200, where the row associated with a given node contains the relative path to the node. For example, the row produced in the view for node 2 would contain the path “/a/b”. Similarly, the row produced in the view for node 6 would contain the path “/a/c/f”. In this example, the condition “UNDER_PATH(root)=True” would filter out any rows in table 302 that do not correspond to nodes of hierarchy 200. Such a filter is useful, for example, if table 302 is used to store information for numerous hierarchies.
Evaluation Optimizations
[0079] As mentioned above, the evaluation of hierarchical operators may involve performing numerous scans of the table 350 that stores the parent-child relationship information. One way to reduce the cost of the evaluations is to use an index, as mentioned above. Another way to reduce the cost of the evaluations involves using information obtained during the evaluation of one hierarchical operator for the evaluation of another hierarchical operator. For example, a single database statement may contain both the PATH and UNDER_PATH operators. The information obtained in the same scans of table 350 can be used to evaluate both operators.
Hardware Overview
[0080] FIG. 4 is a block diagram that illustrates a computer system 400 upon which an embodiment of the invention may be implemented. Computer system 400 includes a bus 402 or other communication mechanism for communicating information, and a processor 404 coupled with bus 402 for processing information. Computer system 400 also includes a main memory 406, such as a random access memory (RAM) or other dynamic storage device, coupled to bus 402 for storing information and instructions to be executed by processor 404. Main memory 406 also may be used for storing temporary variables or other intermediate information during execution of instructions to be executed by processor 404. Computer system 400 further includes a read only memory (ROM) 408 or other static storage device coupled to bus 402 for storing static information and instructions for processor 404. A storage device 410, such as a magnetic disk or optical disk, is provided and coupled to bus 402 for storing information and instructions.
[0081] Computer system 400 may be coupled via bus 402 to a display 412, such as a cathode ray tube (CRT), for displaying information to a computer user. An input device 414, including alphanumeric and other keys, is coupled to bus 402 for communicating information and command selections to processor 404. Another type of user input device is cursor control 416, such as a mouse, a trackball, or cursor direction keys for communicating direction information and command selections to processor 404 and for controlling cursor movement on display 412. This input device typically has two degrees of freedom in two axes, a first axis (e.g., x) and a second axis (e.g., y), that allows the device to specify positions in a plane.
[0082] The invention is related to the use of computer system 400 for implementing the techniques described herein. According to one embodiment of the invention, those techniques are performed by computer system 400 in response to processor 404 executing one or more sequences of one or more instructions contained in main memory 406. Such instructions may be read into main memory 406 from another computer-readable medium, such as storage device 410. Execution of the sequences of instructions contained in main memory 406 causes processor 404 to perform the process steps described herein. In alternative embodiments, hard-wired circuitry may be used in place of or in combination with software instructions to implement the invention. Thus, embodiments of the invention are not limited to any specific combination of hardware circuitry and software.
[0083] The term “computer-readable medium” as used herein refers to any medium that participates in providing instructions to processor 404 for execution. Such a medium may take many forms, including but not limited to, non-volatile media, volatile media, and transmission media. Non-volatile media includes, for example, optical or magnetic disks, such as storage device 410. Volatile media includes dynamic memory, such as main memory 406. Transmission media includes coaxial cables, copper wire and fiber optics, including the wires that comprise bus 402. Transmission media can also take the form of acoustic or light waves, such as those generated during radio-wave and infra-red data communications.
[0084] Common forms of computer-readable media include, for example, a floppy disk, a flexible disk, hard disk, magnetic tape, or any other magnetic medium, a CD-ROM, any other optical medium, punchcards, papertape, any other physical medium with patterns of holes, a RAM, a PROM, and EPROM, a FLASH-EPROM, any other memory chip or cartridge, a carrier wave as described hereinafter, or any other medium from which a computer can read.
[0085] Various forms of computer readable media may be involved in carrying one or more sequences of one or more instructions to processor 404 for execution. For example, the instructions may initially be carried on a magnetic disk of a remote computer. The remote computer can load the instructions into its dynamic memory and send the instructions over a telephone line using a modem. A modem local to computer system 400 can receive the data on the telephone line and use an infra-red transmitter to convert the data to an infra-red signal. An infra-red detector can receive the data carried in the infra-red signal and appropriate circuitry can place the data on bus 402. Bus 402 carries the data to main memory 406, from which processor 404 retrieves and executes the instructions. The instructions received by main memory 406 may optionally be stored on storage device 410 either before or after execution by processor 404.
[0086] Computer system 400 also includes a communication interface 418 coupled to bus 402. Communication interface 418 provides a two-way data communication coupling to a network link 420 that is connected to a local network 422. For example, communication interface 418 may be an integrated services digital network (ISDN) card or a modem to provide a data communication connection to a corresponding type of telephone line. As another example, communication interface 418 may be a local area network (LAN) card to provide a data communication connection to a compatible LAN. Wireless links may also be implemented. In any such implementation, communication interface 418 sends and receives electrical, electromagnetic or optical signals that carry digital data streams representing various types of information.
[0087] Network link 420 typically provides data communication through one or more networks to other data devices. For example, network link 420 may provide a connection through local network 422 to a host computer 424 or to data equipment operated by an Internet Service Provider (ISP) 426. ISP 426 in turn provides data communication services through the world wide packet data communication network now commonly referred to as the “Internet” 428. Local network 422 and Internet 428 both use electrical, electromagnetic or optical signals that carry digital data streams. The signals through the various networks and the signals on network link 420 and through communication interface 418, which carry the digital data to and from computer system 400, are exemplary forms of carrier waves transporting the information.
[0088] Computer system 400 can send messages and receive data, including program code, through the network(s), network link 420 and communication interface 418. In the Internet example, a server 430 might transmit a requested code for an application program through Internet 428, ISP 426, local network 422 and communication interface 418.
[0089] The received code may be executed by processor 404 as it is received, and/or stored in storage device 410, or other non-volatile storage for later execution. In this manner, computer system 400 may obtain application code in the form of a carrier wave.
[0090] In the foregoing specification, the invention has been described with reference to specific embodiments thereof. It will, however, be evident that various modifications and changes may be made thereto without departing from the broader spirit and scope of the invention. The specification and drawings are, accordingly, to be regarded in an illustrative rather than a restrictive sense.
Claims
Certificate of Correction present
The claims shown below may not include correction changes. Use the corrected PDF for authoritative text.
What is claimed is:
1. A method of accessing information managed by a relational database system, the method comprising the steps of:
receiving a database language statement that specifies selection criteria for selecting rows managed by the database system;
wherein the rows are associated with nodes in a hierarchy;
wherein the statement includes an operator that specifies that results of said statement are based, at least in part, on respective positions, within the hierarchy, of the nodes associated with the rows;
during execution of said statement, evaluating said operator using information managed by the relational database system about said hierarchy; and
wherein said database language defines said operator as one that evaluates to an output value based on respective positions of nodes within a given hierarchy.
2. The method of claim 1 wherein the step of evaluating the operator includes determining whether a row is associated with a node, within the hierarchy, that has a particular position relative to a particular node in the hierarchy.
3. The method of claim 2 wherein the step of determining whether a row is associated with a node, within the hierarchy, that has a particular position relative to a particular node in the hierarchy includes the step of determining whether the row is associated with a node that is under the particular node in the hierarchy.
4. The method of claim 3 wherein the step of determining whether the row is associated with a node that is under the particular node in the hierarchy includes the steps of:
if conditions in said statement are relatively more restrictive, then traversing up the hierarchy from said node; and
if conditions in said statement are relatively less restrictive, then traversing down the hierarchy from the particular node.
5. The method of claim 2 wherein the step of determining whether a row is associated with a node, within the hierarchy, that has a particular position relative to a particular node in the hierarchy includes the step of determining whether the row is associated with the particular node in the hierarchy.
6. The method of claim 2 wherein the step of determining whether a row is associated with a node, within the hierarchy, that has a particular position relative to a particular node in the hierarchy includes the step of determining whether the row is associated with a node that is within a specified number of levels under the particular node in the hierarchy.
7. The method of claim 1 wherein the step of evaluating said operator includes determining a path, within the hierarchy, to a particular node.
8. The method of claim 1 wherein the step of evaluating said operator includes determining a depth, within the hierarchy, of a node associated with a particular row.
9. The method of claim 1 wherein the step of evaluating said operator using information managed by the relational database system about said hierarchy includes evaluating said operator using a relational table that includes rows that hold data indicating parent-child relationships between nodes of said hierarchy.
10. The method of claim 9 wherein the statement includes a plurality of hierarchical operators, the method further comprising using information obtained in a particular scan of the relational table to evaluate each of said plurality of hierarchical operators.
11. The method of claim 10 wherein the plurality of hierarchical operators include at least two operators from a set that includes UNDER_PATH, PATH, DEPTH, and EQUALS_PATH.
12. A computer-readable medium carrying instructions for accessing information managed by a relational database system, the instructions comprising instructions for performing the steps of:
receiving a database language statement that specifies selection criteria for selecting rows managed by the database system;
wherein the rows are associated with nodes in a hierarchy;
wherein the statement includes an operator that specifies that results of said statement are based, at least in part, on respective positions, within the hierarchy, of the nodes associated with the rows;
during execution of said statement, evaluating said operator using information managed by the relational database system about said hierarchy; and
wherein said database language defines said operator as one that evaluates to an output value based on respective positions of nodes within a given hierarchy.
13. The computer-readable medium of claim 12 wherein the step of evaluating the operator includes determining whether a row is associated with a node, within the hierarchy, that has a particular position relative to a particular node in the hierarchy.
14. The computer-readable medium of claim 13 wherein the step of determining whether a row is associated with a node, within the hierarchy, that has a particular position relative to a particular node in the hierarchy includes the step of determining whether the row is associated with a node that is under the particular node in the hierarchy.
15. The computer-readable medium of claim 13 wherein the step of determining whether a row is associated with a node, within the hierarchy, that has a particular position relative to a particular node in the hierarchy includes the step of determining whether the row is associated with the particular node in the hierarchy.
16. The computer-readable medium of claim 13 wherein the step of determining whether a row is associated with a node, within the hierarchy, that has a particular position relative to a particular node in the hierarchy includes the step of determining whether the row is associated with a node that is within a specified number of levels under the particular node in the hierarchy.
17. The method of claim 12 wherein the step of evaluating said operator includes determining a path, within the hierarchy, to a particular node.
18. The computer-readable medium of claim 12 wherein the step of evaluating said operator includes determining a depth, within the hierarchy, of a node associated with a particular row.
19. The computer-readable medium of claim 12 wherein the step of evaluating said operator using information managed by the relational database system about said hierarchy includes evaluating said operator using a relational table that includes rows that hold data indicating parent-child relationships between nodes of said hierarchy.
20. The computer-readable medium of claim 19 wherein the statement includes a plurality of hierarchical operators, the computer-readable medium further comprising instructions for using information obtained in a particular scan of the relational table to evaluate each of said plurality of hierarchical operators.
21. The computer-readable medium of claim 20 wherein the plurality of hierarchical operators include at least two operators from a set that includes UNDER_PATH, PATH, DEPTH, and EQUALS_PATH.
Patent Citations (55)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US5295261(A) | 1994-03-01 | Simonetti | Examiner |
| US5404513(A) | 1995-04-01 | Powers et al. | Applicant |
| US5467471(A) | 1995-11-01 | Bader | Examiner |
| US5680614(A) | 1997-10-01 | Bakuya et al. | Applicant |
| US5724577(A) | 1998-03-01 | Exley et al. | Examiner |
| US5734887(A) | 1998-03-01 | Kingberg et al. | Examiner |
| US5974407(A) | 1999-10-01 | Sacks | Examiner |
| US6003040(A) | 1999-12-01 | Mital et al. | Applicant |
| US6038563(A) | 2000-03-01 | Bapat et al. | Applicant |
| US6055544(A) | 2000-04-01 | DeRose et al. | Applicant |
| US6061684(A) | 2000-05-01 | Glasser et al. | Applicant |
| US6128610(A) | 2000-10-01 | Srinivasan et al. | Applicant |
| US6141655(A) | 2000-10-01 | Johnson et al. | Applicant |
| US6154741(A) | 2000-11-01 | Feldman | Applicant |
| US6189012(B1) | 2001-02-01 | Mital et al. | Applicant |
| US6199195(B1) | 2001-03-01 | Goodwin et al. | Applicant |
| US6208993(B1) | 2001-03-01 | Shadmone | Applicant |
| US6236988(B1) | 2001-05-01 | Aldred | Applicant |
| US6263332(B1) | 2001-07-01 | Nasr et al. | Applicant |
| US6269380(B1) | 2001-07-01 | Terry et al. | Applicant |
| US6279006(B1) | 2001-08-01 | Shigemi et al. | Applicant |
| US6279007(B1) | 2001-08-01 | Uppala | Applicant |
| US6298349(B1) | 2001-10-01 | Toyoshima et al. | Applicant |
| US6343287(B1) | 2002-01-01 | Kumar et al. | Applicant |
| US6356920(B1) | 2002-03-01 | Vandersluis | Applicant |
| US6366934(B1) | 2002-04-01 | Cheng et al. | Applicant |
| US6370537(B1) | 2002-04-01 | Gilbert et al. | Applicant |
| US6470344(B1) | 2002-10-01 | Kothuri et al. | Applicant |
| US6487546(B1) | 2002-11-01 | Witkowski | Applicant |
| US6496842(B1) | 2002-12-01 | Lyness | Applicant |
| US6571231(B1) | 2003-05-01 | Sedlar | Examiner |
| US6604100(B1) | 2003-08-01 | Fernandez et al. | Applicant |
| US6636845(B1) | 2003-10-01 | Chau et al. | Applicant |
| US6704739(B1) | 2004-03-01 | Craft et al. | Applicant |
| US6704747(B1) | 2004-03-01 | Fong | Applicant |
| US6718322(B1) | 2004-04-01 | Brye | Examiner |
| US6725212(B1) | 2004-04-01 | Couch et al. | Applicant |
| US6754661(B1) | 2004-06-01 | Hallin et al. | Examiner |
| US6772350(B1) | 2004-08-01 | Belani et al. | Applicant |
| US6785673(B1) | 2004-08-01 | Fernandez et al. | Applicant |
| US2002/0184401(A1) | 2002-12-01 | Kadel, Jr. et al. | Applicant |
| US2003/0004937(A1) | 2003-01-01 | Salmenkaita et al. | Applicant |
| US2003/0009361(A1) | 2003-01-01 | Hancock et al. | Applicant |
| US2003/0065659(A1) | 2003-04-01 | Agarwal et al. | Applicant |
| US2003/0093672(A1) | 2003-05-01 | Cichowlas | Applicant |
| US2003/0101194(A1) | 2003-05-01 | Rys et al. | Applicant |
| US2003/0182624(A1) | 2003-09-01 | Large | Applicant |
| US2004/0043758(A1) | 2004-03-01 | Sorvari et al. | Applicant |
| US2004/0064466(A1) | 2004-04-01 | Manikutty et al. | Applicant |
| US2004/0176958(A1) | 2004-09-01 | Salmenkaita et al. | Applicant |
| US2004/0225680(A1) | 2004-11-01 | Cameron et al. | Applicant |
| US2005/0050058(A1) | 2005-03-01 | Jain et al. | Applicant |
| US2005/0050092(A1) | 2005-03-01 | Jain et al. | Applicant |
| WO1/59602(A1) | 2001-08-01 | Applicant | |
| WO1/61566(A1) | 2001-08-01 | Applicant |
Non-Patent Literature (9)
- R. Bourret, et al., “A Generic Load/Extract Utility For Data Transfer Between XML Documents and Relational Databases,” Proc. Second International Workshop on Advanced Issues of E-Commerce and Web-Based Information Systems, IEEE Computing Society, Jun. 8-9, 2000, pp. 134-143.Applicant
- S. Vorthmann, et al. “Beyond Schemas, Schema Adjuncts and the Outside World,” Markup Languages, Online!, vol. 2, No. 3, Jun. 2000, pp. 1-8.Applicant
- Mi-Ok Chae, et al., “Design and Implementation of an Object-Oriented Multimedia DBMS Tightly Coupled with Information Retrieval Functions,” Proc. 17th IASTED International Conference on Applied Informatics, Feb. 15-18, 1999, abstract.Applicant
- Hansrudi Noser, et al., “Dynamic 3D Visualization of Database-Defined Tree Structures on the WWW by Using Rewriting Systems,” 2000, IEEE, XP-002262516, pp. 247-254.Applicant
- Sushil Jajodia, et al., “Toward a Multilevel Secure Relational Data Model,” ACM, 1991, 8393 SIGMOD Record, Jun. 20, 1991, No. 2, New York, US, XP 000364619, pp. 50-59.Applicant
- Daniele Braga et al., “A Graphical Environment to Query XML Data with Query,” Proceedings of the Fourth International Conference on Web Information Systems Engineering (WISE '03), 2003, IEEE, 10 pages.Applicant
- Josephine Cheng, et al., “IBM DB2 XML Extender, An end-to-end solution for storing and retreiving XML documents.,” IEEE, 2000, ICDE '00 Conference, San Diego, Feb. 2000, 128 pages.Applicant
- Chen, Ruey-Shun et al., “Developing an XML framework for metadata system”, Trinity College Dublin, Proc. of the 1st Inter. Sympo. on Information and Communication, pp. 267-272.Applicant
- Manolescu, Dragos, Review of “Metadata solutions: using metamodels, repositories, XML, and enterprise portals to generate information on demand by Adrienne Tannenbaum”, Mar. 2003, ACM Press, vol. 28, Issue 2, p. 38.Applicant