Patent application number | Description | Published |
20090019077 | Accelerating value-based lookup of XML document in XQuery - A method and apparatus for accelerating value-based lookups of XML documents in XQuery is provided. XML indices can help to optimize SQL queries of XML documents stored in object-relational databases. Certain SQL/XML functions such as XMLTABLE( ) use XQuery expressions to query XML documents. Previously, such queries could not use the XML index because the PATH table of the XML index was not defined for XQuery semantics. Techniques described herein extend the XML index for use with queries that require evaluation of XQuery expressions. Consequently, techniques described herein accelerate value-based lookups of XML documents in XQuery by introducing the possibility of an index-assisted evaluation of XQuery expressions. | 01-15-2009 |
20090037368 | FAST PATH LOADING OF XML DATA - Techniques for implementing fast loading of binary XML into a binary XML database repository are provided. A client application reduces the processing burden on the repository by doing pre-processing of the binary XML data prior to loading. | 02-05-2009 |
20090125494 | GLOBAL QUERY NORMALIZATION TO IMPROVE XML INDEX BASED REWRITES FOR PATH SUBSETTED INDEX - Techniques for processing a query that includes a path expression are provided. A query processor determines whether an XML index may be used to execute the query instead of having to scan multiple XML documents. The query is parsed and normalized, which results in multiple normalized path expressions that are based on the original path expression. If the XML index is a path-subsetted index, then the query processor generates annotated path expressions based on the normalized path expressions. The query processor determines whether each of the annotated path expressions is satisfiable by the path-subsetted XML index. If so, then the XML index is used to process the query. | 05-14-2009 |
20090158047 | HIGH PERFORMANCE SECURE CACHING IN THE MID-TIER - In a multi-tier data server system, data from the first tier is cached in a mid-tier cache of the middle tier. Access control information from the first tier for the data is also cached within the mid-tier cache. Caching the security information in the middle tier allows the middle tier to make access control decisions regarding requests for data made by clients in the outer tier. | 06-18-2009 |
20100023478 | Utilizing Path IDs For Name And Namespace Searches - In a database system, names and namespace of XML nodes are computed from path ids. The path ids are constructed from tokens, each of which represents a particular name or namespace-name pair. | 01-28-2010 |
20100030727 | Technique For Using Occurrence Constraints To Optimize XML Index Access - Approaches are provided for improving the performance of certain database queries that operate on binary-encoded XML. In particular, the approach uses occurrence and type constraint information about XML data stored in the database for optimizing the relational rewrite of a query. Constraint information can be obtained in several different ways including through a formal language specification such as an XML Schema or DTD, through discovery of a user-provided secondary index on a an XML path table, or through a structural summary that is derived from statistical analysis on a set of XML documents stored in the database. | 02-04-2010 |
20100036825 | Interleaving Query Transformations For XML Indexes - During query optimization, XML index and view merge transformations may be interleaved. | 02-11-2010 |
20110060726 | TECHNIQUE TO GATHER STATISTICS ON VERY LARGE HIERARCHICAL COLLECTIONS IN A SCALABLE AND EFFICIENT MANNER - Techniques are provided for efficiently collecting statistics for hierarchically-organized collections of data. A database system leverages container-level modification time stamps and stored subtree-level change information to gather statistical information from only those resources in a hierarchical collection for which the statistics have changed since the last time that statistics were gathered for the collection. A lockless data structure is also described for storing the subtree-level change information in which an identifier corresponding to each subtree in a collection containing a changed resource may be stored. This data structure may be a table that is distinct from one or more tables representing the collection. In one embodiment of the invention, the immediate parent resource of a particular modified resource may be omitted from the subtree table by leveraging modification time stamps while gathering statistics based on tracked subtree-level information. | 03-10-2011 |
20110119283 | TECHNIQUES FOR EFFICIENT QUERIES ON A FILE SYSTEM-LIKE REPOSITORY - Techniques are provided to achieve performance improvements for path-based access to hierarchical data and for utilizing an extensible indexing framework. Extensible operators may be optimized by evaluating the operators using functions native to the database system instead of using functions defined through an extensible indexing mechanism. Furthermore, the database system may resolve a resource path of a query when the query is compiled, and may store the mapping of the resource path to one or more resources in a cursor for the query execution plan to avoid resolving the resource path each time the cursor is used to run the query. The cursor may be made dependent on the one or more resources to which the resource path refers at compile time. This takes advantage of the observation that the mapping of the resource path to particular resources rarely changes between evaluations of a particular query. | 05-19-2011 |
20110137963 | PERFORMING AN ACTION IN RESPONSE TO A FILE SYSTEM EVENT - A method and apparatus for performing an action in response to a file system event is provided. According to one aspect, sets of “event listeners” are associated with a file hierarchy and/or the nodes thereof. Each event listener contains a set of “event handlers.” Each event handler corresponds to a separate type of event that may occur relative to the file hierarchy's nodes. When an event is going to occur relative to the hierarchy or a node thereof, all event listeners that are associated with that hierarchy/node are inspected to determine whether those event listeners contain any event handlers that correspond to the event's type. Those event handlers that correspond to the event's type are placed in an ordered list of event handlers to be invoked. As the event handlers in the list are invoked, programmatic mechanisms that correspond to those event handlers are executed to perform customized user-specified actions. | 06-09-2011 |
20110179089 | TECHNIQUES FOR EFFICIENT AND SCALABLE PROCESSING OF COMPLEX SETS OF XML SCHEMAS - Techniques are described herein for efficient and scalable processing of complex sets of XML schemas. The techniques described herein provide for reducing duplication of schema elements in volatile memory by building an XML schema in-memory model that stores repeating schema elements in in-memory data structures that are separate from in-memory data structures that store the parent schema elements which logically include or otherwise refer to the repeating schema elements. The techniques described herein also provide for faster generation of an in-memory model of an XML schema by pre-loading, in data structures on persistent storage, of schema elements from dependent XML schemas that are referenced and/or incorporated by the XML schema. The techniques described herein also provide for efficient processing of inter-dependent XML schemas by tracking all unresolved schema elements from dependent XML schemas and freeing the portions of volatile memory, which are used to process schema elements from the dependent XML schemas, as soon as the dependent schema elements being processed are stored in data structures on persistent storage. | 07-21-2011 |
20120150865 | Techniques For Efficient Queries On A File System-Like Repository - Techniques are provided to achieve performance improvements for path-based access to hierarchical data and for utilizing an extensible indexing framework. Extensible operators may be optimized by evaluating the operators using functions native to the database system instead of using functions defined through an extensible indexing mechanism. Furthermore, the database system may resolve a resource path of a query when the query is compiled, and may store the mapping of the resource path to one or more resources in a cursor for the query execution plan to avoid resolving the resource path each time the cursor is used to run the query. The cursor may be made dependent on the one or more resources to which the resource path refers at compile time. This takes advantage of the observation that the mapping of the resource path to particular resources rarely changes between evaluations of a particular query. | 06-14-2012 |
20130318109 | ISOLATION FOR APPLICATIONS WORKING ON SHARED XML DATA - A mechanism is provided for detecting and disregarding application specific nodes contained in shared XML documents. The techniques described involve determining one or more application specific nodes within XML documents and performing path expression evaluations of the XML documents as if the nodes are not present. In one embodiment, a mechanism is provided by which a user may specify the criterion that determine which subset of node in XML documents are to be ignored from path expression evaluations and evaluating a query that specifies a path operation based on a path and ignoring said identified nodes when evaluating said path operation. | 11-28-2013 |
20150088894 | PRODUCING SENTIMENT-AWARE RESULTS FROM A SEARCH QUERY - A method, system, and computer program product for information retrieval and sentiment assessment. The method parses a sentiment-aware query to isolate one or more lexical terms to be included in a lexical retrieval of documents containing the lexical terms. The parsing of the query includes parsing the query to isolate portions of the query to be included in the configuration of a sentiment analysis of the retrieved documents. The documents retrieved based on the lexical terms are processed so as to generate a sentiment assessment, and the sentiment found in the retrieved documents might be correlated to terms that are not present in the lexical terms. The sentiment assessment is presented as a “positive” or “negative” indication, or as a sentiment assessment score. The sentiment portion of the query can specify an area of interest, and/or can specify a user-selected classifier model that is used to process the retrieved documents. | 03-26-2015 |