Abstract: An index monitoring system for selectively removing an index, where the index is used in a computerized database search. An example method implemented by the system includes displaying a list of indexes on the display device; providing an indication of an index usage criterion associated with each of two or more of the indexes, where the index usage criterion is derived at least in part from prior execution of a particular database query statement; displaying on the display device an indication of the particular database query statement; and optionally accepting a signal from a user-input device to remove an index.

Abstract: Personalized content is generated from different media items using a content index. The content index is generated or updated by identifying segments of media items that are of particular interest to users. User interactions with the media items are analyzed and metadata of segments of media items that are determined to be of particular interest to the users is recorded. The parameters associated with a request for personalized content for a user are matched with the recorded metadata to identify relevant media items or segments of media items which are transmitted to the user as the personalized content.

Abstract: A system includes a multi-system database management system having a plurality of database systems. An index selection subsystem combines sets of query information from respective ones of the plurality of database systems into a workload. The index selection subsystem then generates candidate indexes from the workload, and selects recommended indexes from the candidate indexes based on one or more criteria.

Abstract: The subject disclosure is directed towards using fingerprints, comprising lists of simulation results corresponding to partial (random sampled) simulation results, to determine whether a full simulation may be avoided by reusing simulation results from a previous full simulation. Before running a full simulation, a current fingerprint is obtained via a partial simulation. If a previous fingerprint matches (is identical or similar to) the current fingerprint, the associated previous results are reused. Also described is indexing fingerprint data to facilitate efficient lookup-based fingerprint matching.

Abstract: A query that identifies an input data source is received. The input data source is partitioned into a plurality of partitions. Each of the partitions includes a set of data elements with an associated set of indices for indicating an ordering of the data elements. A query type for a query operator in the received query is identified. It is determined whether a reordering of data elements will be performed based on the identified query type. The data elements in at least one of the partitions are reordered when it is determined based on the identified query type that reordering will be performed.

Abstract: Systems and methods are provided for document searching. In one implementation, a computer-implemented method provides keyword searching. The method may receive a plurality of noisy keywords for a document collection. A server may generate tokens for a plurality of keywords in the document collection and merge the tokens to create an index. A search query may be received. The search query may include at least one search phrase. For the at least one search phrase, an indication may be received from a user specifying to perform one of a noisy phrase search or a noiseless phrase search. The method may search the index for the at least one search phrase based on the indication received from the user.

Abstract: Hyperspace index data structure. A data structure indexes identifiers corresponding to parameter patterns. The presence of an identifier in the data structure indicates that the corresponding parameter pattern may be present in a set of parameter patterns, while absence of the indicator can be used to indicate that the corresponding parameter pattern is not present. The data structure includes a first field which includes binary bits or groups of small parameter pattern keyed records. Each binary bit or parameter pattern keyed record corresponds to an identifier corresponding to a parameter pattern. If the bit or record corresponding to the identifier is set or present, the identifier is included in the first field. One or more additional fields are hierarchically below the first data field. Each of the additional fields includes identifiers for a subset of information in the first field.

Abstract: A method and a system are provided for generating a multi-region cluster of tables of contents for a volume (e.g., album, a movie, a CD, a DVD, and/or a Blu-ray Disc). A multi-region cluster may be used to identify a volume efficiently despite natural variations found in different tables of contents for a volume. A multi-region cluster provides an effective representation of at least two tables of contents, preferably multiple tables of contents. A multi-region cluster is preferably substantially less data than the sum of all the tables of contents from user devices. The condensed data of a multi-region cluster allows data associated with the volume to be analyzed (e.g., searched, organized and/or located) in a substantially faster and more accurate manner. During a search process, the use of multi-region clusters tends to reduce the number of false positives. A false positive means the system incorrectly matches a table of contents to a volume (e.g., album, a movie, a CD, a DVD, and/or a Blu-ray Disc).

Abstract: Techniques are described for data redistribution in a database system. Embodiments store a first set of receiver location identifiers mapped to a document identifier, the first set of receiver location identifiers assigned to a first set of receiver locations storing relational data referencing the document identifier. Embodiments further store a second set of receiver location identifiers mapped to the document identifier, the second set of receiver location identifiers assigned to a second set of receiver locations storing document data corresponding to the document identifier referenced by the relational data. Sender index keys are received separately from the relational data and the document data, the sender index keys referencing the document identifier and containing sender location identifiers.

Abstract: Methods, systems, and computer-readable media of columnar storage of a database index are disclosed. A particular columnar index includes a column store that stores rows of the columnar index in a column-wise fashion and a delta store that stores rows of the columnar index in a row-wise fashion. The column store also includes an absence flag array. The absence flag array includes entries that indicate whether certain rows have been logically deleted from the column store.

Abstract: Techniques and approaches are provided for creating indexes and column constraints on structured XML data that is stored in a relational database. Data Definition Language (DDL) Create Index and Create Constraint commands have extended syntax that allows the specification of a path-based expression instead of requiring a column and table name. A mapping created by the system when an XML Schema is registered stores the correspondence of XML data elements to automatically-created database tables and columns that are given names only useful for the internal system. When a user provides a path-based expression in a DDL when creating an index or constraint, the path-based expression is translated to the underlying database constructs using the mapping. Issues are addressed for handling path-based expressions that evaluate to more than one element. Additional index optimization is described using data type information available in the XML schema to select the optimal index type.

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: Introduced is information that indicates a changing of “a reference that points a referenced record” to “another reference that points another record”. This information is named as “changing reference information (CRI)” and is registered to a referred record. When accessing a referencing record, there is a possibility to access referenced record by necessity of a program or an operator. At this time, CRI registered to originally referenced record is accessed. And the reference is changes to new record as indicated by the CRI. Thus, status of a DB in a device is changed by the invention. When PCs have reproduced DBs that are copy of the original and edit their own reproduced DBs so as to change a reference, these editorial contents with CRI will be propagated to other PCs. Other PCs change references of their reproduced DBs according to the CRIs.

Abstract: Hyperspace index data structure. A data structure indexes identifiers corresponding to parameter patterns. The presence of an identifier in the data structure indicates that the corresponding parameter pattern may be present in a set of parameter patterns, while absence of the indicator can be used to indicate that the corresponding parameter pattern is not present. The data structure includes a first field which includes binary bits or groups of small parameter pattern keyed records. Each binary bit or parameter pattern keyed record corresponds to an identifier corresponding to a parameter pattern. If the bit or record corresponding to the identifier is set or present, the identifier is included in the first field. One or more additional fields are hierarchically below the first data field. Each of the additional fields includes identifiers for a subset of information in the first field.

Abstract: A method and a system defragment indexes in a relational database. The relational database contains a set of tables, in which each table contains a set of indexes, in which, for each index, a fragmentation parameter is associated indicating the fragmentation level of the index. The method includes the following steps: getting a list of the set of tables; for each table of the list, getting the fragmentation parameter associated to each index of the table; and depending on the value of the fragmentation parameter, defragmenting the associated index.

Abstract: Systems and methods for processing an index are described. An index may be merged with another index of comparable age and size into a single index. Since older indexes are less likely to need updating, they are “set aside” to age based on certain adaptive criteria such as the age and size of the index, percentage of deletions, and how long it takes to update the index. An index that has been set aside may be compacted into a format that is optimized for fast searching.

Abstract: A search engine comprising search indices for entities, wherein a tag reputation of a tag which classifies an entity is updated by said search engine depending on a rating input by said user and depending on a user reputation of said user.

Abstract: A database system uses indexes to improve performance. The system can use one or more of the following: differentiated subfields for index clustering; set function calculations to reduce the amount of I/O; and/or using an inferred index in a circular table.

Abstract: A database system uses indexes to improve performance. The system can use one or more of the following: differentiated subfields for index clustering; set function calculations to reduce the amount of I/O; and/or using an inferred index in a circular table.

Abstract: Methods and systems for the generation of computer readable indexes or other ordered lists are provided. A corpus of electronic documents or other electronic information is parsed into postings that include key and reference pairs. An inversion buffer in memory is explicitly or implicitly formatted to receive the postings in a predetermined order by key. Each key is assigned a space in the inversion buffer that is subsequently filled with references associated with the key during an inversion method. In an embodiment, an index file is generated directly from the inversion buffer, or in the case of large inversions, from a plurality of inversion buffer segments.

Abstract: A system providing three-dimensional visual navigation for a mobile unit includes a location calculation unit for calculating an instantaneous position of the mobile unit, a viewpoint control unit for determining a viewing frustum from the instantaneous position, a scenegraph manager in communication with at least one geo-database to obtain geographic object data associated with the viewing frustum and generating a scenegraph organizing the geographic object data, and a scenegraph renderer which graphically renders the scenegraph in real time. To enhance depiction, a method for blending images of different resolutions in the scenegraph reduces abrupt changes as the mobile unit moves relative to the depicted geographic objects. Data structures for storage and run-time access of information regarding the geographic object data permit on-demand loading of the data based on the viewing frustum and allow the navigational system to dynamically load, on-demand, only those objects that are visible to the user.