Oracle International Corporation

Wesley Lin

Zhen Hua Liu

Thomas Baby

Seema Sundara

Dinesh Das

Yasuhiro Matsuda

Mohammad Faisal

Ravi Palakodety

Ravi Murthy

Muralidhar Krishnaprasad

Garret Frederick Swart

Vikas Arora

Ying Hu

James W Warner

Sriram Krishnamurthy

Susan M Kotsovolos

Anand Manikutty

Geeta Arora

Sundeep Abraham

Rohan Angrish

Garrett Kaminaga

Neha Narkhede

Systems, methods, and other embodiments associated with real-time text indexing are described. One example method includes receiving a document for indexing in a search system that includes a mature index and indexing the received document in a staging index. The staging index may be stored in direct access memory associated with query processing that does not degrade query performance even when postings become fragmented. The staging index and the mature text index are accessed to process queries on the search system. The example method may also include periodically merging the staging index into the mature index based on query feedback.

Real-time text indexing

Systems, methods, and other embodiments associated with text indexing for updateable tokenized text are described. One example method includes receiving revised tokenized text intended to replace existing tokenized text in an indexed document. Token location information corresponding to the revised tokenized text is stored in an allocated free space portion of a text index posting.

Text indexing for updateable tokenized text

Techniques are provided for searching within a collection of XML documents. A relational table in an XML index stores an entry for each node of a set of nodes in the collection. Each entry of the relational table stores an order key and a path identifier along with the atomized value of the node. An index on the atomized value provides a mechanism to perform a node-aware full-text search. Instead of storing the atomized value in the table, a virtual column may be created to represent, for each node, the atomized value of the node. Alternately, each entry of the relational table stores an order key and a path identifier along with, for simple nodes, the atomized value, and for complex nodes, a null value. For a complex node with a descendant text node, a separate entry is stored for the descendant text node in the relational table.

Indexing mechanism for efficient node-aware full-text search over XML

Techniques are provided for searching within a collection of XML documents. A relational table stores an entry for each node of a set of nodes in a collection of XML documents. Each entry of the relational table stores an order key and a path identifier along with the atomized value of the node. Instead of storing the atomized value in a full-text index, a virtual column can be created to represent, for each node, the atomized value of the node. Alternately, each entry of the relational table stores an order key and a path identifier along with, for simple nodes, the atomized value, and for complex nodes, a null value. For a complex node with a descendant text node, a separate entry is stored for the descendant text node in the relational table.

Indexing strategy with improved DML performance and space usage for node-aware full-text search over XML

In one embodiment, a database server registers one or more functions included in a user-defined index that includes one or more auxiliary properties. The one or more functions are operable to generate index entries of the user-defined index for the one or more auxiliary properties. The one or more auxiliary properties are different than, and in addition to, a primary property of the user-defined index that provides for evaluating a query operator. The database server receives a first statement that defines the user-defined index, where the first statement includes one or more parameters that define the one or more auxiliary properties. The database server invokes the one or more functions in response to the first statement, where the one or more functions when invoked generate and store the index entries of the user-defined index according to the one or more parameters that define the one or more auxiliary properties.

Techniques for extending user-defined indexes with auxiliary properties

In one embodiment, a database server registers one or more functions included in a user-defined index that includes one or more auxiliary properties. The database server receives a query that specifies one or more parameters. A query optimizer generates a plurality of execution plans for evaluating the query. The query optimizer estimates a plurality of total costs respectively associated with the plurality of execution plans, where estimating a particular total cost associated with a particular execution plan comprises: invoking the one or more functions with one or more function arguments based on the one or more parameters; receiving one or more index costs that are associated with using the one or more auxiliary properties of the user-defined index to evaluate the query; and determining the particular total cost based on the one or more index costs. From the plurality of execution plans, the query optimizer selects an optimal execution plan that is associated with an optimal total cost of the plurality of total costs.

Techniques for optimizing SQL statements using user-defined indexes with auxiliary properties

Systems, methods, and other embodiments associated with selectively acquiring and utilizing query statistics are described. One example method includes selectively acquiring statistics associated with search queries submitted to a search process during a sample period. The statistics may be associated with an index and tokens associated with the index and search queries. The method may also include selecting tokens and/or queries to optimize based, at least in part, on the statistics. In one example, whether and/or how the tokens and/or queries are optimized may depend on estimating index fragmentation based, at least in part, on the statistics.

Query statistics

A method and apparatus for rewriting a database command containing an embedded XML expression such that the rewritten database command recites a text function, in lieu of the embedded XML expression, is provided. Advantageously, a DBMS may take advantage of the efficiencies in storing XML data within the database, while avoiding the generation of unnecessary XML elements in processing the query when the XML elements contribute nothing to the outcome of the query. Cost-base or rule-based analysis may be performed to determine how to rewrite a received database command. The database server may functionally evaluate the text function or may use an index defined on a column of the database. The text function may function as a primary filter or may reference a column upon which an index is defined, wherein the index operates at the same or higher level than a column being referenced in the embedded XML expression.

Techniques for efficient integration of text searching with queries over XML data

A method and apparatus for processing a query is provided. A query for a set of Matching XML documents is received. A client may transmit the query for a set of XML documents to the database server. The database server transmits a request for the set of XML documents to a persistent storage. The persistent storage uses an index, at least in part, to obtain the set of XML documents sought by the query. The index stores a first set of entries comprising information about the location of elements, a second set of entries comprising information about element attributes, and a third set of entries comprising information about element values. In responding to a particular query, additional XML documents that are not indexed by the index may also be checked to determine if they correspond to the set of search criteria.

Growing community of inventors

West Covina, CA, United States of America

Wesley Lin