Abstract: A system, method and program product for processing an inputted XPath query against an XML document. A method is disclose that includes: generating a path index and an MTree structure index from the XML document using a computing device, wherein the MTree structure index has at least one qpath; executing a query against the path index to generate an initial sequence containing a node for each qpath in the XML document that satisfies the query; generating a hash map from the initial sequence from an MTree structure index containing path ids that are located along qpaths in a second MTree structure index; and testing the path id of each node located along a qpath of the Mtree structure index against the path id in the hash map to generate a result sequence.

Abstract: An approach for using functional indexes as a primary filter is provided. A database query that contains a reference to a column of a table, but does not contain any reference to a functional index based on that column, is received by a database server. The database server adds to the database query a reference to the functional index on the column. The database server determines if the database query should be executed using the functional index. If the database server determines that the database query should be executed using the functional index, then the database query is executed with the functional index. If the database server determines that the database query should not be executed using the functional index, then data that indicates that the functional index is not to be evaluated when the database query is executed is stored.

Abstract: Data indexing using polyarchical indexing codes and automatically generated expansion paths. For a piece of data, an indexing code is received relating to a particular categorization or other indexing parameter. Based upon the indexing code, one or more expansion sets of codes are retrieved and applied to the piece of data. The expansion sets of codes may include indexing codes that relate to hierarchical levels of indexing. The expansion sets of codes may also include different expansion paths through the hierarchical levels of indexing. The polyarchical codes may include multiple cross-categorization of the data across the same or different levels of categories. They may also include multiple expansion paths in different directions across hierarchical levels of categories or indexing.

Abstract: An approach is provided for reducing decision diagram related communication traffic and cost by utilizing existing hash identifiers of decision diagrams. A hash identifier application receives a plurality of hash identifiers computed based on a respective plurality of reduced ordered binary decision diagrams constructed for resource description framework graphs. Thereafter, the hash identifier application initiates storage of the hash identifiers for use and subsequent reuse.

Abstract: Various embodiments of a computer-implemented method, computer program product, and data processing system are provided that generate an index plan that produces a superset of data comprising the query result. In some embodiments, a computer-implemented method, computer program product, and data processing system produce a maximal-index-satisfiable query tree.

Abstract: The present invention relates to a processing method of data stream using Border Monitoring Query, and more particularly a monitoring method and a system for data streams which are a large volume of data and continuously generated such as financial ticker, GPS data or a ubiquitous sensor network (USN). The objectives of the present invention are to process a large number of BMQs over data streams in high-performance and scalable manner. For this purpose, the invention presents BMQ-Index, a scalable and high performance data stream monitoring framework. The main idea of BMQ-Index is shared and incremental processing. For shared processing, BMQ-Index adopts a query indexing approach, thereby achieving a high level of scalability. Once BMQ-Index is built on registered queries, only relevant queries are quickly searched for upon an incoming data. For incremental processing, BMQ-Index employs an incremental access method, i.e.

Abstract: A method is disclosed for indexing and querying XML documents stored in a relational database. A user is allowed to choose columns of a database table for storing XML data of a known structure. The user has to input one or more XML paths for indexed data. Each path is stored in a static index table. In response to the input of the user defined paths, at least one dynamic index table is created for each static index table. The dynamic index table is updated upon data being entered into the database table. When a user's query is intercepted, any XML expression part of the query is processed and converted into one or more rows in the static index table. A new query is generated against the dynamic indexing tables, using the values obtained from the static index table, and executed. The user's query is then rewritten by transforming the XML path part of the user's query expression into a format understood by the database query engine.

Abstract: The subject matter disclosed herein relates to processing information regarding events. In one particular example, a stabbing query may be formulated in response to an event. One or more sets are associated with and/or mapped to nodes of a tree.

Abstract: A computing system hosts a plurality of websites, a plurality of external data sources, and a search service. External resources in each of the external data sources are partitioned among a plurality of external partitions. The search service automatically generates an index comprising index entries. The index entries are partitioned among a plurality of index partitions, each associated with one or more of the websites. For each given index partition, the index entries in the given index partition map terms to resources in the given set of resources that contain the terms. The given set of resources includes web pages in a given set of websites associated with the given index partition and external resources in external partitions used by the given set of websites. The search service uses the index entries in given index partition to identify resources in the given set of resources containing query terms.

Abstract: Under automated alternate plan analysis, a query optimizer generates candidate execution plans. The candidate execution plans are selected as alternate execution plans for the query and execution. Output describing characteristics of each alternate execution plan and/or its execution is generated and/or compared. From this information, it may be determined, for example, whether results returned by any of the alternate execution plans are the same and whether the least cost execution plan is actually the most efficiently executed.

Abstract: Systems and methods for managing data, such as metadata or index databases. In one exemplary method, a notification that an existing file has been modified or that a new file has been created is received by an indexing software component, which then, in response to the notification performs an indexing operation, where the notification is either not based solely on time or user input or the notification includes an identifier that identifies the file. Other methods in data processing systems and machine readable media are also described.

Abstract: Methods, computer programs, and database systems for performing a database query to join a column A and a column B on an inequality condition are disclosed. A database includes value-count indexes for columns A and B. Minimum and a maximum values for A and B are determined, using the value-count indexes for A and B, respectively. The method includes defining three or more sets of values in A and B, relative to the minimum and maximum values for B and A, respectively. The method includes generating one or more Cartesian products between values in A and B. The database query is performed on a set of values in A and a set of values in B to generate a partial query result. The method includes merging one or more Cartesian products and the partial query result.

Abstract: Techniques for self-tuning indices for databases, including flash-based databases, are described. Using a data tree structure wherein the nodes of the data tree may operate in two modes (e.g. disk mode or log mode), a self-tuning index determines whether it is more economical to perform a requested operation on a node in its current mode or in an alternate mode. The operation is then performed on the node using the more economical mode.

Abstract: A database engine and optimizer framework support creation of a series of profiling indices over a column having character string data, such as a traditional “varchar” data type. The profiling indices result in a reduction of the number of records that are searched when searching for a sub-string match within that column. In some embodiments, the series of indices are created over a column that is typically searched using the LIKE predicate or some similar technique; these indices indicate for each record whether certain sub-strings may exist in that record's value in the column. Thus, the indices are used to find the rows that may match one or more portions of the particular term being queried or, in other words, eliminate those records that do not have at least a portion of the term to be matched. The number of records actually retrieved and searched for the query sub-string is thereby reduced.

Abstract: Systems, devices, features, and methods for detecting geographic features in images, such as, for example, to develop a navigation database are disclosed. For example, a method of detecting a path marking from collected images includes collecting a plurality of images of geographic areas along a path. An image of the plurality of images is selected. Components that represent an object on the path in the selected image are determined. In one embodiment, the determined components are independent or invariant to scale of the object. The determined components are compared to reference components in a data library. If the determined components substantially meet a matching threshold with the reference components, the object in the selected image is identified to be a path marking corresponding to the reference components in the data library.

Abstract: A system and method for on-demand indexing in a data management system is described. An index is generated when it is requested, such as when a database operation requires access to the index. If the index is loaded in memory, the index is retrieved from memory. Otherwise, the index is generated on-demand. A priority configuration identifies at least one priority index which is generated and loaded in memory. The priority configuration can identify priority indexes either directly or indirectly, such as by a threshold parameter.

Abstract: An automated method of matching an input document to a set of documents from a document repository. A signature database is stored, the signature database including a document identifier and signatures generated by a first signature generator for each of the set of documents. The input document is received and signatures are generated for the input document using a second signature generator, and the signature database is searched using the signatures generated for the input document. The first and second signature generators are configured such that different numbers of signatures are generated for a same document. Other embodiments, aspects and features are also disclosed.

Abstract: Statistics for temporary tables are used in optimizing the execution of a database request. A first temporary table is created using data from a data source as the result of performing an operation while executing the request. A subset of the demographics of the data source is saved in a session level memory as the demographics of the first temporary table. The saved demographics are used in optimizing the execution of the portion of the request involving the first temporary table.

Abstract: Embodiments of the present invention provide for methods, systems and computer program products for learning ranking functions to determine the ranking of one or more content items that are responsive to a query. The present invention includes generating one or more training sets comprising one or more content item-query pairs and determining one or more contradicting pairs in a given training sets. An optimization function to minimize the number of contradicting pairs in the training set is formulated, and modified by incorporating a grade difference between one or more content items corresponding to the query in the training set and applied to each query in the training set. A ranking function is determined based on the application of regression trees on the queries of the training set minimized by the optimization function and stored for application to content item-query pairs not contained in the one or more training sets.

Abstract: Systems and methods of storing DNS data associated with a telephone number are presented. These systems and methods can reduce storage space needs, increase access speed and/or result in other benefits, in comparison with the prior art. In some embodiments, DNS data is indexed using a numerical representation of a telephone number rather than an alphanumeric representation. In some embodiments, DNS data associated with several different telephone numbers are grouped together within a single DNS data record and indexed using a secondary key. In some embodiments, DNS data is compressed.

Abstract: Systems, methodologies, media, and other embodiments associated with supporting materialized views with user-defined aggregates are described. One example system includes logic for exposing a set of interface actions to support a user-defined aggregate in a materialized view associated with a base table. The materialized view may store both the user-defined aggregate and a user-defined aggregate context that facilitates logically connecting the user-defined aggregate to the base table. The example system may also include logic for supporting the user-defined aggregate. The support may be based on the set of interface actions. Example systems and methods may, therefore, facilitate incremental updating of the materialized view and/or rewriting a query to access the materialized view.

Abstract: A system and method for identifying a selection of index candidates for a relational database. The system includes a Predicate Analyzer for examining database queries in workload and recording column and predicate information; a Search Engine for performing a combinatorial search of index candidates; an Index Emulator for emulating the existence of a set of candidate indexes by making necessary “fake” entries into the relational database management system data dictionary; and a Query Optimizer for estimating the cost of a given query within a given index configuration. In accordance with the method, data indicative of a workload comprising one or more queries is received, and predicates are then analysed and organized into column groups for each basic predicate type. Statistics are collected on each of these groups. Non-predicate portions of each query are scanned to obtain additional covering columns. A combinational search is performed on the column groups to identify covering and non-covering candidates.

Abstract: A search suggestion system and method for a product/service database which provides an improved, bifurcated search result search result algorithm. A vectored index of a product/service database is first generated. As a search query is typed, the letters/words are processed through a lexographical matching module, compared to the index, and a subset of the index is identified. The subset is then ranked according to (1) the user's history, (2) most popular sales data, (3) most often viewed products, and (4) lexographical weights. The highest ranked items are then displayed in a drop-down list to the user.

Abstract: Techniques for partitioning indexes are provided. A predefined data type associated with a column of a database table is acquired. Column value statistics for the column are acquired. The values are analyzed to produce multiple partitions for the values. Each partition includes each of the values and each partition includes multiple groupings of the values. Also, each grouping of a particular partition includes a subset or range of the values. Furthermore, each grouping of a partition includes a same distribution for the values as other groupings of that partition. Each partition represents a potential partitioning index for the column and its values.

Abstract: More efficient querying of a multi-tenant database using dynamic tuning of database indices. A layer of meta-data associates data items with tenants, e.g., via tags, and the meta-data is used to optimize searches by channeling processing resources during a query to only those pieces of data bearing the relevant tenant's unique tag.

Abstract: A method for implementing adaptive merging in database indexes includes selecting a key range from a database query having a range predicate and searching a database for data matching the key range. The data matching the key range is merged to form a collected dataset which is stored for future retrieval. A method for optimizing B-tree representation of a database using actual queries is also provided.

Abstract: A method can be used to profile a user using network addresses, category information, and demographic data when the user requested or received information from those network addresses. A table can be created that includes the user identifier, category information, and demographic data. The user profile can be generated and based at least in part on the user identifier, category information, and at least some of the demographic data.

Abstract: Techniques of index clustering for full text search engines are described herein. In one embodiment, a full text search is performed by a search node using a local copy of an index within the searching node during a search session. In response to an update of a list of data entries the relational database through a Common API (common in the sense the update triggered to the relational DB will also trigger an index change), an index update event is scheduled to update a master copy of the index directory. Periodically the local copy of the index directory is updated by copying index data from the master copy of the index directory (totally or incrementally). Other methods and apparatuses are also described.

Abstract: According to one embodiment of the invention, a method for managing an index arrangement for a directory includes storing a plurality of data values from the directory in an alternate evaluator. The alternate evaluator includes a processor operable to process a directory operation. The method also includes generating a first index corresponding to the plurality of data values, the first index comprising at least one page having a variable size. The method further includes storing a first value in the at least one page and a corresponding pointer to each occurrence of the respective data value stored in the alternate evaluator.

Abstract: A method of selecting graphic or video files having corresponding locators used to locate such graphic or video files using a computer. Identifiers are created by searching an area within a web page near a graphic or video file for searchable identification terms and searching an area within a web page near links to a graphic or video for searchable identification terms. The identifiers are stored in a database. User requests for graphic or video file content are received and the database of identifiers is searched to find graphic and video files corresponding criteria of the user. Graphic or video file content is then provided to the user.

Abstract: Reducing access time for data in a file system when seek requests are received ahead of access requests. In one embodiment, an operating system providing access to the file system receives a seek request (from a user application) indicating an identifier of a file and a location within the file at which a data is sought to be accessed. In response, the operating system computes the offset of a disk block containing the location (thereby the data that is sought to be accessed). On receiving an access request (after the seek request from the same user application) indicating an operation to be performed on the data, the operating system executes the operation on the data using the pre-computed offset of the disk block. The computation of the disk block is performed before the access request is received thereby reducing the time required to process the access request.

Abstract: The described implementations relate to filtered index recommendations. In one case a filtered index recommendation (FIR) tool is configured to recommend a final set of filtered indexes to use with a workload. The final set is selected from a first set of candidate filtered indexes and a second set of merged filtered indexes.

Abstract: A common interface to manage heterogeneous databases and develop enterprise class applications is provided. In particular, it is shown that a client-based system and method can: (a) provide a uniform interface for the DBA or the application developer to use across all the database deployments, (b) provide flexibility in the number and kinds of scenarios it can be used, and finally (c) reduce the total cost of ownership for the enterprise.

Abstract: According to one embodiment of the present invention, a method for identifying relevant database indexes is provided. According to one embodiment of the present invention, a method includes determining the importance of a particular database transaction and storing an index name related to the transaction along with an indicator of the importance. A database transaction is initiated and the importance indicator is received in an index advisor. The index advisor then makes an index recommendation based on the index importance.

Abstract: A method, apparatus, and program product is provided to, in response to receiving a first database query for which usage of shared weight indices is prohibited, determine whether a shared weight index associated with a column of a database table referenced by the first database query can be utilized as a non-shared weight index to optimize the database query. The method, apparatus, and program product determine whether the column includes at least one changed weight value and determines whether the database query references at least one changed weight value in the column. The shared weight index is utilized to optimize the first database query in response to determining that the shared weight index can be utilized as a non-shared weight index to optimize the first database query.

Abstract: The present invention concerns an XML data base management system (XDBMS, 10) for an XML database (20) comprising XML documents (30), each XML document (30) comprising one or more structural elements (35) and adhering to an XML schema (40), wherein at least one of the structural elements (35) is protected against access of a user (60), the XDBMS (10) comprising: a. an optimizer (300) adapted to process an XQuery (50) of the user (60) comprising one or more XQuery expressions (55) and further adapted to generate an optimized XQuery execution plan (70); b. an execution engine (400) adapted to execute the optimized XQuery execution plan (70) to retrieve XML data (80) from the XML database (20), characterized in that c. the optimizer (300) is adapted to generate the optimized XQuery execution plan (70), so that all XQuery expressions (55) relating to one or more of the structural elements (35) which are protected against access of the user (60) are ignored by the optimizer (300).

Abstract: A method and apparatus are provided for improving the data processing speed through the storage of the record information of an identity module. In the method for improving data processing speed, a request for input/output of at least one predetermined record stored in the identity module from an application is received. Metadata about the requested record of the identity module and the request are transmitted to the identity module. Results corresponding to the request are received from the identity module, and are transmitted to the application.

Abstract: An improved human user computer interface system, wherein a user characteristic or set of characteristics, such as demographic profile or societal “role”, is employed to define a scope or domain of operation. The operation itself may be a database search, to interactively define a taxonomic context for the operation, a business negotiation, or other activity. After retrieval of results, a scoring or ranking may be applied according to user define criteria, which are, for example, commensurate with the relevance to the context, but may be, for example, by date, source, or other secondary criteria. A user profile is preferably stored in a computer accessible form, and may be used to provide a history of use, persistent customization, collaborative filtering and demographic information for the user.

Abstract: A system that performs a database operation which involves accessing user-defined fields which are stored in a custom field table, wherein the user-defined fields are used to augment an existing table. During operation, the system performs the database operation which involves accessing the user defined fields. While accessing the user-defined fields, the system performs a mapping between the user-defined fields and custom fields in the custom field table, wherein each row in the custom field table includes a position field and multiple custom fields.

Abstract: A database server provides a partitioned table with a corresponding locally partitioned index. When a request is made to load data into the table by an application, a table partition, along with a corresponding index partition, is created for the application. The corresponding index partition in marked as asynchronously maintained, allowing other index partitions to be used by the query optimizer in formulating query plans for other table partitions. Once the loading of data is complete, a synchronization operation is called with the result of conforming the data in the asynchronously maintained index partition with its corresponding table in which the data was loaded. Once the data in the corresponding table partition and the data in the asynchronously maintained index partition are synchronized, the asynchronously maintained index partition is marked as synchronously maintained.

Abstract: A method, apparatus and program product is provided for optimizing a database query. A query syntax, system generated predicates, and requisite statistics of the database query are analyzed to determine if a predicate structure is a good candidate for a symbol table only data structure. The predicate structure is analyzed to determine if the predicate structure is already encompassed by an encoded vector index. The symbol table only data structure is generated for at least one column in a database table without generating a corresponding vector data structure from an encoded vector index if the predicate structure is a good candidate and not encompassed by an encoded vector index. The symbol table only data structure is maintained by detecting a change in data associated with the symbol table only data structure and updating the symbol table only data structure to reflect the change in the data.

Abstract: Technologies for forming logical indexes and utilizing such indexes so as to abstract many of the complexities resulting from referencing partitioned database tables. Included are technologies for making use of order-preserving properties of table metadata, for adding a partition equality predicate to an explicit predicate in merge-join processing on partitioned tables, and for selecting execution of a logical skip scan on a partitioned table when a query predicate does not reference a specific partition. Such technologies generally abstract from the query writer and processing systems explicit referencing of table partitions.

Abstract: A computer implemented method of searching personals ads comprising: performing a criteria search to identify one or more personals ads; and performing an affinity search to identify personals ads having an affinity to at least one of the personals ads identified by the criteria search.

Abstract: The disclosure describes search systems and methods in which exact token searches, spelling suggestions, and split-token searches are used in conjunction to return search results to the user. Depending on the number and relevancy of results for the search query results from each of the steps the results are either merged or discarded into the final result set. The split-token search is adapted to generate two split-tokens from the token(s) of the search query in anticipation that the search token(s) is misspelled. As the location of the misspelling is unknown, the split-token search widens the scope of the results provided in response to the search. In an embodiment, the split-token search includes performing a prefix search for tokens matching a prefix split-token and a postfix search for tokens matching a postfix split-token. In an embodiment, the index is specially adapted to allow the postfix search to be performed more efficiently.

Abstract: A method for creating a data warehousing scheme having optimally selected components. A mathematical model of a goal for the data warehousing scheme is input into an optimization engine. At least one constraint on the data warehousing scheme is input into the optimization engine. A mathematical optimization algorithm is performed using the optimization engine, wherein an output of the optimization engine is an optimized data warehousing scheme having optimally selected components. The optimized data warehousing scheme can be stored.

Abstract: A method for using dual indices to support query expansion, relevance/non-relevance models, blind/relevance feedback and an intelligent search interface, comprising using a computing device (89) to: access (101) an inverted index (103) to obtain an initial retrieval of results in response to a query, and to generate a rank list of the results, the results referring to information units (IUs) where the query occurs; and determine (105) a number of “N” IUs in the results that are assumed to be relevant by accessing a forward index (104); wherein the forward index (104) and inverted index (103) have pointers to locations in the IUs where terms of the query occur, and the forward index (104) retrieves a term frequency vector of the IU or a set of contexts of the IU.

Abstract: A database management system that has bitmap values in which set bits in a representation of a bitstring specify a set of objects whose definitions are built into the database management system. The database management system further includes user-accessible operations on the bitmap values. The bitmap values are represented by means of a mapping specifier that specifies a range of the set of objects and a representation of a string of bits that has been mapped onto the set of object specified by the range specifier. Objects containing bitmap values may be indexed by means of an index tree that includes summary bitmap values.

Abstract: Searching for an item using an accessing application as a search parameter is described, including receiving a search query to perform a search for an item, the search query having at least an accessing application that has accessed the item, searching for the item using the search query, and presenting a search result based on the search.

Abstract: A method and system for managing indexes used to retrieve data from a database stored on a computer, includes determining whether any marginal indexes exist in the database, and removing one or more of the marginal indexes from the database. An index is considered marginal when: (1) it is an access path for one or more queries but the index's performance is matched or nearly matched by one or more other alternative access paths, and/or (2) its overhead has become a concern. These steps or functions are invoked by one or more statements or instructions that cause the computer to perform a Drop Index Analysis on a specified list of tables in the database for a specified workload. The Drop Index Analysis allows users to specify: (1) how many indexes to consider dropping, and/or (2) how much disk space that dropped indexes should free up.

Abstract: A system for full text indexing optimization that operates based on identification of idle and active content in a content source, and by prioritizing indexing of idle content over active content. Active and idle content items are automatically identified, and idle content items are given a higher priority for indexing, while active content items are given a lower priority. Active content items are generally those that are considered relatively more likely to be located by the user without using the full text indexing function, while idle content items are those content items that are relatively more likely to be located through use of the full text indexing function. The specific content item attributes that are used to determine whether a given content item is active or idle may depend on the type content source for which the full text index is being provided.