Abstract: According to an embodiment, a data processor includes a storage unit that stores a set of character strings that is a set of character string elements of which magnitude correlation is uniquely identifiable; a data converter that encrypts numerical data included in data to be managed, generates an index value corresponding to the numerical data using the character string elements included in the set of character strings, and generates converted data including the encrypted numerical data and the index value; a first transmitting unit transmits the converted data to a server; a query expression converter that converts a condition part including a numerical value of a query expression into a condition part including the character string elements to generate a converted query expression; a second transmitting unit that transmits the converted query expression to the server; and a receiving unit that receives, from the server, a result of query.

Abstract: Systems are disclosed of processing a set-level query across one or more attributes, the query being grouped by one or more attributes, whereby groups that satisfy the set-level query may be aggregated over one or more attributes. The systems use bitwise arithmetic to efficiently traverse bitmap and bit-slice vectors and indexes of a data relation to determine groups that solve the set-level query.

Abstract: Method and systems for performing high volume searches are described. In one example a method includes receiving a query directed to a database, the database including a plurality of items, determining whether the query complies with one of a plurality of search criteria, each of the plurality of search criteria corresponding to a predefined index of the database, selecting a predefined index of the database corresponding to one of the plurality of search criteria if the query complies with said search criterion, the index containing entries that comply with the corresponding search criterion, applying the query to the selected index to find database items referenced in the index, selecting items based on applying the query to the selected index, building a report for the query, the report including only items of the selected index.

Abstract: A vehicle identification number (VIN) decoder (VDC) implementing a unique VIN decoding method may, for a given VIN, shorten the VIN and form a stem and a leaf therefrom. Utilizing the stem, the VDC may operate to find matching leaf values, if any, from a set of look up tables. Depending upon a match outcome, one or more trim identification code (TIC) values can be assigned to the VIN and a candidate list can be constructed utilizing the assigned TIC value(s). The candidate list, which can be optimized, may contain one or more candidate trims for the VIN. For each candidate trim, a confidence score and match probability can be generated. The VDC may provide decoded information containing trim data associated with at least one of the one or more candidate trims for the VIN to a client device over a network connection.

Abstract: According to one embodiment of the present invention, a method for processing join predicates in full-text indexes is provided. The method includes evaluating local predicates of an outer full text index to generate a first posting list of documents. For each document in the first posting list, the value of a join attribute is determined and an inner full text index is probed to obtain a second posting list of documents containing one of the join attributes determined for each document. Local predicates of an inner full text index are evaluated to generate a third posting list of documents, and the second posting list is merged with the third posting list to generate a merge list of documents. Documents in the first posting list may be paired up with documents in the merge list.

Abstract: An information communication system for exchanging a plurality of contents between a plurality of node devices, includes a plurality of internal networks connected to an external network. The internal networks include: the plurality of node devices connecting the same internal network; and a support device, which connects the internal networks, and which supports acquisition of contents by the node devices. An overlay network allows for exchanging of contents between the node devices and the support devices. The node devices include a first acquisition unit that acquires contents by selecting a first device group in preference to a second device group. The first device group includes: a support device and a node device connecting the internal network of an access destination that is a contents acquisition destination. The second device group includes a support device and a node device that do not connect the internal network of the access destination.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for information retrieval. In one aspect, a method includes receiving a fact query; determining an expected type of answer to the fact query; identifying search results responsive to the fact query; identifying phrases from the resources corresponding to the search results that correspond to a form of the expected type; determining a score for each of the identified phrases; and presenting an answer to the fact query using the scores.

Abstract: Provided are a method, system, and article of manufacture for searching documents for ranges of numeric values. Document identifiers for documents are accessed, wherein the documents include at least one value that is a member of a set of values. A number of posting lists are generated. Each posting list is associated with a range of consecutive values within the set of values and includes document identifiers for documents including at least one value within the range of consecutive values associated with the posting list, and wherein each document identifier is associated with one value in the set of values included in the document identified by the document identifier. The generated posting lists are stored, wherein the posting lists are used to process a query on a range of values within the set of values.

Abstract: The techniques presented herein are directed towards providing a user-directed keyword-based search on a large collection of XML documents, and displaying a summary of results to the user. Prior to receiving search requests from a user, an offline analysis of a large collection of XML documents is performed to construct an inverted index of keywords. For each keyword, the index stores a set of location indicators that identify all the instances of the keyword found in the collection of documents. Once the index is constructed, keyword searching can be done efficiently by a keyword lookup in the index. Various display strategies enable the user to see the specific portion of a large XML document containing the keyword and/or path frequency information allowing the user to easily refine the search to specific paths within the collection of documents.

Abstract: A database query optimization method is provided for database queries that include predicates, the queries being directed to at least one database table having data in rows and columns. The method includes associating a lineage bit set with each row of the database table, the lineage bit set providing a binary predicate state indication whether each predicate is met or are not met by data in the row. A dependency bit set is established to provide a binary indication of the predicates that are included in each query. Queries are applied against the database table by a logical operation between the lineage bit set and the dependency bit set. A database query optimization data structure includes a lineage bit set associated with each row in the database table. The lineage bit set provides a binary predicate state indication whether each predicate is met or are not met by data in the row.

Abstract: Storing historical/previous values of a field of a relational database in the same table. The previous values can be conveniently used to revert back to any of such previously stored values. Thus, for each update/modify operation, the present value is stored as a previous value. In one embodiment, the previous values are stored in a VARRAY associated with each field. The indexed entries of the VARRAY store the present as well as previous values of the field.

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 to: access an inverted index 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 a number of “N” IUs in the results that are regarded by the computing device to be relevant by accessing a forward index; and use the forward index to perform any one from the group consisting of: computing query expansion weights for top “N” retrieved IUs, building the relevance models by the contexts of query terms in the top “N” retrieved IUs, and finding the longest contiguous sequences of query terms in a query found in an IU; wherein the forward index and inverted index have pointers to locations in the IUs where terms of the query occur, and the forward index retrieves a term frequency vector o

Abstract: A method is described herein that includes receiving a query from a user at a computing device. The method also includes performing a search for one or more documents based at least in part upon the received query, wherein performing the search comprises causing a processor to perform the search through utilization of a search cache retained on the computing device, wherein the search cache comprises a results cache, an index cache, and a Boolean cache.

Abstract: One embodiment relates to a computer-implemented method for multiple-keyword matching performed using a computer including at least a processor, data storage, and computer-readable instructions. A keyword set and a text string to be searched are obtained. A suffix sorting procedure is applied to the text string to create a suffix index array. A dual binary keyword search procedure is applied to a reference list of suffix strings presented by the suffix index array. The dual binary keyword search procedure may apply a recursive function that utilizes a divide-and-conquer process and may have inputs of a results list, the suffix index array, and the keyword set. The recursive function may add a range of items to the results list if a keyword is determined to be a prefix of a suffix string in the reference list. Other embodiments, aspects, and features are also disclosed.

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: Systems and methods for article location and retrieval are described. In one described method, the normal processing of an operating system call associated with a dialog control is interrupted, and a search dialog control is displayed. The search dialog control is associated with an index comprising a plurality of events. Each of the plurality of events may be associated with at least one of a plurality of client applications and at least some of the plurality of events can be captured in real time. Each event may be associated with one or more articles.

Abstract: Range query techniques are disclosed for use in accordance with data stream processing systems. A technique is provided for incrementally processing continual range queries against moving objects. This may be done for location-aware services and applications. For example, a technique for evaluating one or more continual range queries over one or more moving objects comprises maintaining a query index with one or more containment-encoded virtual constructs associated with the one or more continual range queries over the one or more moving objects, and incrementally evaluating the one or more continual range queries using the query index.

Abstract: Provided are techniques for retrieving a document that includes for each page an area that is ignored by applications that process the document and that includes a different internal index set associated with each subset of pages of the document, wherein each different internal index set is associated with an area and stores indexes, and wherein each of the indexes consists of a name-value pair. Then, for each page in the document, it is determined whether the page is associated with an internal index set; and, in response to determining that the page is associated with an internal index set, one or more name-value pairs from the internal index set are extracted, wherein each of the one or more name-value pairs provides specific information about the document for use in identifying the document.

Abstract: A method to estimate the number of distinct value combinations for a set of attributes in a database system is disclosed. The method comprises utilizing frequency information within the set of attributes to provide a best estimate for the number of distinct value combinations. In a preferred embodiment, the utilizing step comprises estimating the number of distinct value combinations utilizing frequency information of the set of attributes based upon probability theory and further includes providing bounds on the distinct value information combinations utilizing the frequency information of the set of attributes. In so doing, an estimate for the number of distinct value combinations is provided.

Abstract: A method and apparatus for managing numerous messages are provided. The method includes: A. pulling, by a client terminal, a message index list from a server; B. pulling, by the client terminal, message bodies corresponding to message indexes in the message index list in batches; C. managing, by the client terminal, the pulled message bodies and message indexes by using a message pool mode; D. after receiving a finish indication triggered by a user, storing, by the client terminal, the message indexes and the message bodies in the message pool to a local disk. By using the present invention, numerous messages are managed.

Abstract: Generally described, the present disclosure is directed to an eventually consistent replicated data store that uses, for its underlying storage, a computer software library that provides a high-performance embedded database for data. The replicated data store employs a plurality of hosts interconnected to one another, allowing for writes to any host and full awareness of membership across all hosts. With the data replication framework disclosed herein, various modes are allowed to be built up on top of the core system.

Abstract: A method of querying spatial events in a vehicle network includes receiving, by a processing device, a query condition of a user; in response to reception of the query condition of the user, determining context information of a position where the user locates; and according to the query condition of the user and the context information of the position where the user locates, querying an index table recording correspondence between terminal nodes of roads in a road map and spatial events to obtain spatial events meeting the query condition of the user.

Abstract: Disclosed are an apparatus, method, and program product which each provide an enhanced database engine. Access to precise values is provided while permitting unfettered access to those who are not interested in precise values. This is accomplished via an enhanced database index and indexing method. The entries of the database index are normalized to exclude precision. Individuals interested in precision can then specify precision as part of their query through use of a PRECISE keyword. Results are then filtered to account for the specified precision.

Abstract: A query optimizing system and methods employ contextual knowledge about the types and use of data and/or applications in tables underlying a relational database to provide improved queries and/or make recommendations to a query optimizer of a database based upon knowledge of the data and/or application gathered. A multi-tenant database, in which querying is conducted on multiple tenant data stored in a single table, provides for determining tenant-level statistics, data sharing, user/tenant views, user-level access/capacities, custom entities, custom fields and/or other contextual information about users and tenants, and for providing query optimization and/or query optimizer recommendations corresponding to such information.

Abstract: Graphical user interfaces that are well suited for displaying search results from multiple search categories are described. In one aspect of the invention, a graphical user interface is provided that includes a window having at least two panes that are arranged to display search results from searches in different search categories. Each pane can be presented in an open state suitable for displaying information and a closed state. A user may adjust the relative sizes of the panes and the user may switch the panes between the open and closed states.

Abstract: A method of searching data on a computer system includes accepting a search query, searching multiple applications on the computer system for data related to the search query wherein the data can be in a variety of formats and displaying search results wherein the search results comprise data related to the search query.

Abstract: A document preprocessor preprocess a document to enhance the statistical features of the document. The system preprocesses the document by matching a prefix and a trailing context in the document with one or more matching prefixes in a transformation database, where the prefix is a first string of one or more tokens in the first document and the trailing context is a second string of one or more tokens in the first document that trail the prefix. Alternatively, the system preprocesses the document by computing cyclic permutations of the document, sorting these permutations and taking the last token from each of the sorted permutations.

Abstract: System, methods and articles of manufacture for joining data in the database tables comprising, performing an index scan on a global index of a first database table, determining rows in the first database table that may be joined with a second database table based on a needed partitioning, wherein the needed partitioning is determined using an index scan, determining a number of partitions in the second database table, and joining each of the corresponding partitions in the first database table with a corresponding partitions in the second database table.

Abstract: Inverted indexes for terms and for term separators are separately provided to minimize data redundancy. Search queries are parsed to identify terms and term separators, if any, and the corresponding inverted indexes are searched for responsive documents. Related apparatus, systems, techniques and articles are also described.

Abstract: Making data available from a database is disclosed. Making data available includes specifying a query function having a query function name, wherein the query function includes a structure and a member, determining the structure and the member included in the query function, wherein the query function has a query function name and includes the structure and the member, creating an index for the structure on the member, and compiling the query function to be available to a user by invoking the query function name without the user having to specify the structure and the member. Retrieving data from a database is disclosed. Retrieving includes invoking a query function that specifies a plurality of structures and a value, accessing a cross index of the plurality of structures, and using the cross index to access the data.

Abstract: A Structured Query Language (SQL) adapter business service that converts data from a data set to a common representation format used for all data sets with which the SQL adapter business service interacts. Hence the SQL adapter business service can communicate with various internal and external systems independently of the native format in which those systems maintain and store data. The SQL adapter business service optimizes operations to update data in the data sets by combining operations when possible and by using result sets from executing previous SQL statements to construct subsequent SQL statements. SQL adapter business service takes advantage of parent/child relationships between tables to construct SQL statements in an order such that the SQL statements process only a minimum amount of data, thereby making retrieval of data as efficient as possible.

Abstract: A method, apparatus and program product use a first index associated with a field in a database table to identify a range of records in the database table that includes instances of a first key value in the field and use the identified range of records to subset a second index associated with another field in a database table. The database query identifies the first key value for the field in the database table and the second key value for the other field in the database table. By doing so, information from an index may be carried over and applied to another index to subset the other index, often reducing the quantity of entries that are searched in the other index and improving performance.

Abstract: Generally described, embodiments of the present invention provide the ability to generate a universal query result set from several different search index result sets by including identifications of items from the different search index result sets in an accurate manner. After a query has been submitted, search index result sets are received from several different search indexes, an allocation score for each search index is computed and a universal item score for the top-level item identified in each search index is computed. The method then combines the allocation score and the universal item score for the top level item for each search index result set and adds the item with the highest combined score to the universal query result set.

Abstract: The present invention extends to methods, systems, and computer program products for deriving document similarity indices. Embodiments of the invention include scalable and efficient mechanisms for deriving and updating a document similarity index for a plurality of documents. The number of maintained similarities can be controlled to conserve CPU and storage resources.

Abstract: Serving a search result is disclosed. A security fingerprint of a security configuration is generated. The security fingerprint is concatenated with a query having a search term and a search result is returned that includes both the search term and the security fingerprint.

Abstract: Embodiments are directed to replicating database tables for efficient data querying and to using a background task to update a database index table on a periodic basis. In one scenario, a computer system accesses an existing, original time-based database table that includes various entities and properties for each entity. Each entity also includes a time stamp value. The computer system receives an indication that the new index table is to be indexed according to a user-specified property and sorts the new index table based on both the value of the user-specified property and the time stamp value of the entity to which the user-specified property belongs. The computer system then periodically copies the entities and associated properties of the original time-based database table into a new database index table.

Abstract: A method, apparatus and program product that determine a density of a key value referenced in a database query over at least one range of rows, and utilize the determined density to optimize the database query. By doing so, the density of various key values may be determined and compared, and a bit map may be generated over the range of rows of the key value that is denser, resulting in a reduction of resources to build and use the bit map. Moreover, from the bit map over the range of rows to be selected after using the determined density, dense regions may be identified that can be used to optimize block I/O's according to the number of rows to be selected based on the query.

Abstract: This disclosure relates to learning common spelling errors of metadata terms associated with content through content matching, such as content matching using fingerprints.

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: Systems, methods, and computer program product embodiments are provided for path-based query evaluation. The embodiments include representing a markup language document as a descriptive catalog, and capturing relationships in the descriptive catalog as an index summary. The index summary is utilized for evaluating a path-based query.

Abstract: Database query analysis technology, in which an input query is received that relates to multiple attribute classes of data records. An index that is descriptive of the data records in data storage is accessed and relative positions in the accessed index for the multiple attribute classes are identified. The accessed index is processed based on more than one of the multiple attribute classes and the identified relative positions, and the processed index is used to identify groups of data records that are included in the data records in the data storage and that share common values for the multiple attribute classes in the input query. Metrics corresponding to the data records included in each of the identified groups of data records are accessed, computations are performed on the accessed metrics, and a report is generated that reflects results of the computations.

Abstract: Methods and systems for optimizing queries in a multi-tenant store are described. In one embodiment, such a method includes retrieving data from a multi-tenant database system having a relational data store and a non-relational data store, receiving a request specifying data to be retrieved, retrieving one or more locations of the data to be retrieved, generating a database query based on the request, in which the database query specifies a plurality of data elements to be retrieved, the plurality of data elements including one or more data elements residing within the non-relational data store and one or more other data elements residing within the relational data store, generating an optimized database query having an optimized query syntax that is distinct from a query syntax of the database query, and executing the optimized database query against the multi-tenant database system to retrieve the data.

Abstract: There is disclosed various embodiments of computer systems and methods for analyzing multi-dimensional trends from two dimensional hierarchical data by comparing and analyzing two hierarchies and their associated attributes. Certain embodiments may comprise: providing a database of previous time slice data, receiving new time slice data, comparing the new time slice data to the database of previous time slice data, generating additional attributes, incorporating the additional attributes and the new time slice data into the database so that analysis may be performed between the two hierarchies.

Abstract: Disclosed are various embodiments for managing data indexed by a search engine. A respective identifier from a set of identifiers is assigned randomly in one or more computing devices to each one of a plurality of data records. A set of search queries is provided. A first one of the search queries encompasses all of the set of identifiers. A second search index is generated from a first search index of the data records. The first search index is queried for at most a predetermined number of unmarked ones of the data records using a search query. Each one of a result set of data records that is thereby obtained is inserted into the second search index. The result set of data records is marked in the first search index.

Abstract: Genomic sequence matching and alignment techniques are disclosed. In one embodiment, an index of a reference sequence is constructed that represents all transitions from a single l-mer prefix to multiple m-mer suffixes. This index data structure may take a variety of forms, including an array or a tree. The base position of each transition from l-prefix to m-suffix is recorded in k-bit masked form. The positions data structure may take a variety of forms as well, including an array or a tree. The l-prefix, m-suffix and k-position index is used for rapid assessment of similarity between a query and a reference genomic sequence by means of a table of local hits.

Abstract: An IP server sends e-mail to a mobile device MS. This e-mail includes an application specifier that specifies startup of a Java application stored in mobile device MS and a data specifier that includes data used in operations executed by mobile device MS in accordance with a Java application. On the other hand, the ADF for the Java application stored in mobile device MS includes trusted source data containing a plurality of e-mail addresses that indicate trusted origins. Mobile device MS compares the e-mail transmission origin address with the trusted source data. Mobile device MS, only in the case where the transmission origin address of the received e-mail is included in the trusted source data, starts up a Java application based on an application specifier included in said e-mail, and uses data included in said data specifier in operations executed by that Java application.

Abstract: A system and a method provide in memory two level of indices to a data set, respectively referred to as an instance layer and an entry layer. The instance layer is brought from disk into memory when an application is initialized to allow insertion of new data into the data set. A temporary data structure augments the instance layer and is provided to keep track of the new data. When query processing is required, the entry layer is brought in, so that query processing may be achieved using both the instance layer indices and the entry layer indices. The temporary data is merged into the instance and entry layers and the data set is updated upon termination of the application or at predetermined times, whereupon the resulting data set and index layers are written out to disk.

Abstract: A cost estimator may estimate execution costs for execution of at least one query against a database, using at least one existing index, if any, and based on estimation criteria determined from analyzing the query execution. A candidate index provider may provide candidate indexes, based on the estimation criteria, and re-estimate the execution costs to obtain updated execution costs, using the candidate indexes. An index recommender may recommend a recommended index, based on the updated execution costs.

Abstract: A method, apparatus and program product use a first index associated with a field in a database table to identify a range of records in the database table that includes instances of a first key value in the field and use the identified range of records to subset a second index associated with another field in a database table. The database query identifies the first key value for the field in the database table and the second key value for the other field in the database table. By doing so, information from an index may be carried over and applied to another index to subset the other index, often reducing the quantity of entries that are searched in the other index and improving performance.

Abstract: A data structure embodied on a computer-readable medium in conformance with a database schema for accessing and managing data related to a plurality of watchlists in a relational database system in a high demand environment, wherein the database schema comprising a watchlist table, a watchlist entry table for storing high-level information, and a plurality of detail tables for storing detailed information associated with a watchlist.