Abstract: Optimizing the execution of a query in a multi-database system includes identifying a region within a table, the table being referenced in the query. The region is stored on data-storage devices on first and second system databases in the multi-database system. A first access plan for the query is developed, the first access plan comprising accessing the version of the region stored on the first system database. A second access plan for the query is developed, the second access plan comprising accessing the version of the region stored on the second system database. A selection is made between the first access plan and the second access plan to execute the query. The query is executed using the selected access plan to produce a result.

Abstract: An information management method to be executed by a computer, the information management method includes; accepting a registration request that includes identification information of a mobile device, and position information of the mobile device that includes latitude and longitude; generating a value that includes the identification information followed by information that indicates a date and time when the registration request is accepted; storing the position information in a first storage unit in a manner correlated with the value; generating another value that includes the information that indicates the date and time followed by the identification information; storing the position information in a second storage unit in a manner correlated with the other value; storing the position information in a third storage unit in a manner correlated with the identification information; and storing the identification information in a fourth storage unit in a manner correlated with the position information.

Abstract: An apparatus comprises a hardware accelerator coupled to a memory. The hardware accelerator comprises one or more decompression units. The one or more decompression units are reconfigurable. The hardware accelerator may be a field-programmable gate array. The hardware accelerator may also comprise one or more reconfigurable scanner units. The one or more decompression units, in the aggregate, are operative to decompress one or more rows of a database at a bus speed of the coupling between the hardware accelerator and the memory. Two or more decompression units are operative to decompress two or more rows of a database in parallel. The apparatus allows for hardware accelerated row decompression.

Abstract: A method and system for providing keyword ranking using a common affix is provided. The method for providing keyword ranking using the common affix includes: extracting a common affix using a keyword set; and providing keyword ranking which includes the extracted common affix.

Abstract: A method, system, and computer program product to efficiently search a database is disclosed. The method, system, and computer program product may include structuring the database to have a table, an index associated with the table, and a log associated with the index, the log adapted to include an entry. The method, system, and computer program product may include receiving a search request related to the index. The method, system, and computer program product may include searching the index when the search request is not associated with the entry. The method, system, and computer program product may include accounting for the entry and searching the index when the search request is associated with the entry.

Abstract: A method, system and computer program product for improving performance of concurrent data inserting provide the features of adding a prefix to each key value in an index, wherein the prefix has a default value, allocating a corresponding prefix to each concurrent inserting process in response to an occurrence of a hot spot mode being detected, wherein each allocated prefix is different from the default value, performing an inserting operation in the hot spot mode, wherein the inserting operation includes deciding whether a key value can be inserted with the default value of the prefix, in response to a determination that an insertion of a key value with the default value of the prefix can be performed, inserting the key value with the default value of the prefix, and in response to a determination that an insertion of a key value with the default value of the prefix cannot be performed, inserting the key value with another prefix allocated by the inserting process.

Abstract: A search system architecture is disclosed. The search system architecture includes a search server, which in turn includes a search services module and a search engine adapter. The search services module and the search engine adapter are communicatively coupled to one another. The search services module is configured to communicate with a user interface. The search engine adapter is configured to communicate with a search engine.

Abstract: A data item is retrieved from a data store in a data processing system. The data processing system comprises an index, which at least partially indexes the data store, and also a partiality definition store. The partiality definition store indicates a part of the data store which is referenced by the partial index. A request is received for a data item from the data store and responsive to determining that the requested data item is not referenced by the partial index, the data store is searched by using the partiality definition store to avoid searching a part of the data store which is known to be indexed.

Abstract: What is disclosed includes a method for searching objects in response to a query that includes a first set of criteria pertaining to a first index, a second set of criteria pertaining to a second index, and logic joining the first set of criteria and the second set of criteria. The method includes querying the first and second indexes based on the first and second set of criteria, respectively, to obtain a first set of first-identifier values and a first set of second-identifier values, respectively. The method also includes correlating the first set of second-identifier values with a set of unique-identifier values and/or a second set of first-identifier values. The method also includes using the logic and, the set of unique-identifier values, and/or the second set of first-identifier values to determine a set of matched objects.

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: A data storage and query method supporting an agile development and horizontal scaling, in a field of computer applications, includes steps of: transforming data into a 2-tuple (Key, MiniTable) and identifying any MiniTable (having a data set removed) with a unique Key, wherein the MiniTable includes multiple data columns; a structure of each data column is limited by a pre-defined mode; and the data columns are sorted according to a primary key defined by the mode. The data storage and query method obtains a capability of the horizontal scaling via removing dependency among the data sets, and a capability of the agile development via supporting an analogous SQL grammar by saving dependency among the data within the data sets. The data storage and query method can be applied to a data management system which supports the horizontal scaling of big data and the agile development of short development lifecycles.

Abstract: A transactional sealed storage system enables data to be accessed according to transactional properties and also enables access to the data to be restricted to secured applications. The transactional properties according to which the data may be accessed may include, for example, at least some levels of atomicity, consistency, isolation, and durability. The access to the data may be restricted by, for example, employing a double layer security policy that involves encrypting the data and also authenticating any application that requests access to the encrypted data.

Abstract: A search system architecture is disclosed. The search system architecture includes a search server, which in turn includes a search services module and a search engine adapter. The search services module and the search engine adapter are communicatively coupled to one another. The search services module is configured to communicate with a user interface. The search engine adapter is configured to communicate with a search engine.

Abstract: In a method for improving the efficiency of a search engine in accessing, searching and retrieving information in the form of documents stored in document or content repositories, the search engine comprises an array of search nodes hosted on one or more servers. An index of the stored document is created. The search engine processes a user search query and returns a result set of query-matching documents. The index of the search engine is configured on the basis of one or more document properties and partitioned, replicated and distributed over the array of the search nodes. The search queries are processed on the basis of the distributed index. The method realizes a framework for distributing the index of a search engine across several hosts in a computer cluster, relying on three orthogonal mechanisms for index distribution, namely index partitioning, index replication, and assignment of replicas to hosts.

Abstract: Methods, systems, and computer program products are provided for deriving and updating document similarity indices for a plurality of documents. The number of maintained similarities can be controlled to conserve CPU and storage resources.

Abstract: An approach is provided in which a sample point system allocates sample point identifiers to a root node included an index tree that includes multiple leaf nodes. The sample point system distributes the sample point identifiers to the root node's child nodes, and recursively traverses through the index tree's hierarchical index levels and distributes the sample point identifiers from the child nodes to a subset of the index tree's leaf nodes. In turn, the sample point system collects sample data from the subset of the plurality of leaf nodes corresponding to the distributed sample point identifiers.

Abstract: There is provided a computer-implemented method of executing a query plan against a database. An exemplary method comprises accessing a first subset of rows of a database table using a direct access method for an index. The query plan may comprise the direct access method. The exemplary method also comprises determining a processing cost of accessing the first subset of rows. The exemplary method further comprises modifying the direct access method for the index in response to determining that the processing cost exceeds a specified threshold. Additionally, the exemplary method comprises accessing a second subset of rows of the database table using the modified direct access method.

Abstract: A method for using dual indices to support query expansion, relevance/non-relevance models, blind/relevance feedback and an intelligent search interface, the method comprising: accessing 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 determining a number of “N” IUs in the results that are assumed to be relevant by accessing a forward index; 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 of the IU or a set of contexts of the IU.

Abstract: Methods and systems for identifying information based on matching information to a query based on an index value are disclosed. In one aspect, a method for identifying information entered by a user includes computing an numeric index value, receiving input, calculating a query value, comparing the query value to the index value, and displaying items from the dataset.

Abstract: In general, techniques are described for an RDF (Resource Description Framework) database system which can scale to huge size for realistic data sets of practical interest. In some examples, a database system includes a Resource Description Framework (RDF) database that stores a plurality of data chunks to one or more storage drives, wherein each of the plurality of data chunks includes a plurality of triples of the RDF database. The database system also includes a working memory, a query interface that receives a query for the RDF database, a SPARQL engine that identifies a subset of the data chunks relevant to the query, and an index interface that includes one or more bulk loaders that load the subset of the data chunks to the working memory. The SPARQL engine executes the query only against triples included within the loaded subset of the data chunks to obtain a query result.

Abstract: A method for indexing documents may include receiving a first set of topics relating to a text of a document and a weight for each topic in the first set, where the weight represents how strongly the topic is associated with the document, and generating an update to an index by inserting a reference to the document for each of the topics in the first set. A second set of topics relating to the text of the document and a weight for each topic in the second set may be received. An update to the index may be generated by inserting the reference to the document for topics in the second set that are not in the first set and removing the reference to the document for topics in the first set that are not in the second set.

Abstract: Techniques for indexing file paths of items in a repository may include, for each type associated with instances that are not associated with file path indexes, starting with folder types prior to item types in a round robin sequence, attempting to associate the instances of the type with file path indexes. The repository may be queried for instances of a current type that are not associated with file path indexes and that are filed in a folder that is associated with a file path index. Responsive to the querying returning one or more instances of the current type, the one or more instances of the current type may be associated with the file path indexes. Responsive to the querying returning one or more instances of the current type, attempting to associate the instances of the same current type with file path indexes may be repeated.

Abstract: A sampling based DBR framework which leverages a separate core for program analysis. The framework includes a hardware performance monitor, a DBR service that executes as a separate process and a lightweight DBR agent that executes within a client process. The DBR service aggregates samples from the hardware performance monitor, performs region selection by deducing the program structure around hot samples, performs transformations on the selected regions (e.g. optimization), and generates replacement code. The DBR agent then patches the client process to use the replacement code.

Abstract: The invention is a system of managing indexation of memory. Said system has a microprocessor, and a flash memory. Said flash memory has an indexed area comprising indexed items, and an index that is structured in a plurality of index areas comprising a plurality of entries. Said flash memory comprises an index summary comprising a plurality of elements. Each index summary element is linked to an index area of said index. Each index summary element is built from all entries belonging to said linked index area and is built using k hash functions, with 1?k.

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: The present disclosure describes a method and a system for processing images. The method includes: determining a target folder selected by a user; searching for image information of the target folder, searching for information of all subfolders of the target folder, traversing all subfolders corresponding to the information of all subfolders and obtaining image information of all subfolders; and obtaining images according to the image information of the target folder and the image information of all subfolders, processing the obtained images and displaying the processed images in a flat-folder-view manner.

Abstract: A method and a system are provided for exploring a large textual data set via interactive aggregation. In one example, the method includes receiving the large textual data set and an original query template, building an index for the query template, wherein the building the index comprises ordering the index a particular way to optimize query time, receiving one or more bindings for the original query template, computing an answer to the original query template using the index and the one or more bindings, and anticipating one or more future queries that a user may submit and that are related to the original query template.

Abstract: Architecture and its implementation of an event-based media management system and method are disclosed. A generic model for events is used for developing architecture for media management, called Eventcentric Media Management (EMMa) system. The system focuses on event experiences and provides flexible functionality for media management. The system and method analyze cross-media files for features to extract atomic events and apply algorithms to cluster files including similar or related features. Thus, the EMMa system allows unified media indexing of multiple media types, better abstraction of the real world, use of context, media processing operations to compute and store features and tags, and a more intuitive support for multiple users. It provides environments for querying and browsing media related to events and authoring of multimedia presentations for sharing with other individuals.

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: Consistent with embodiments of the present invention, a method may be provided comprising receiving a search string corresponding to a desired node comprising a target parameter, a policy parameter, and a class parameter. The target parameter may be referenced with a target index table to determine which interfaces to search. The policy parameter may be referenced with a policy index table to determine a node-id of a policy node corresponding to the policy parameter. A level for the desired node may be determined based on the node-id. The class parameter may be referenced with the determined node-id with a class index table to access a bucket location. The desired node may then be searched for with the determined node-id at the determined level.

Abstract: Techniques for accessing a parallel database system via an external program using vertical and/or horizontal partitioning are provided. An external program to a database management system (DBMS) configures external mappers to process a specific portion of query results on specific access module processors of the DBMS that are to house query results. The query is submitted by the external program to the DBMS and the DBMS is directed to organize the query results in a vertical or horizontal manner. Each external mapper accesses its portion of the query results for processing in parallel on its designated AMP or set of AMPS to process the query results.

Abstract: A method for optimizing data types includes the step of generating a data structure providing access to at least one data element, the data structure associated with a first representation of the at least one data element. A user is provided with a plurality of data types for accessing the at least one data element. A request for access to the at least one data element is received, the request including at least one of the plurality of data types. The request is responded to with a second representation of the at least one data element, the second representation generated responsive to the at least one of the plurality of data types.

Abstract: A computer-implemented method for generating online search results includes receiving, over the Internet, referring URL data including a query, and a network site ID for a network site that was visited based on third party search engine analysis of the query; generating indexed query and network site data based on the received referring URL data and network site; receiving a new query from a user; determining a network site relevant to the new query based on the indexed query and network site data; and displaying to the user a link to the network site. Systems for generating online search results are also disclosed.

Abstract: A search index for a collection of documents includes a plurality of keywords associated with the documents. Access to individual documents is detected based on searches employing the search index and keywords are recorded that are utilized in the searches and resulted in document access. The search index is modified to maintain the recorded keywords and remove keywords absent from the searches resulting in the document access.

Abstract: A database performance estimation device includes: a unit that switches at least two types of calculation methods according to configuration mode data and performs the switched calculation method to acquire a child block searching time (d) and a leaf block scanning time (s); a unit that switches at least two types of calculation methods according to the configuration mode data and performs the switched calculation method to acquire an entry inserting time (i); and a unit that calculates an average time required for identifying a target leaf block per one manipulation performed to the index block, an average time required for searching for a target entry in the identified leaf block, and an average time required for inserting a target entry in the identified leaf block, and estimates the total of the average times calculated above as an average processing time per one manipulation performed to the index block.

Abstract: Methods and systems for query optimization for a multi-tenant database system are provided. Some embodiments comprise receiving at a network interface of a server in a multi-tenant database system an original query transmitted to the multi-tenant database system by a user associated with a tenant, wherein the original query is associated with data accessible by the tenant, and wherein the multi-tenant database system includes at least a first index and a second index. Metadata associated with the data is retrieved, wherein at least a portion of the data is stored in a common table within the multi-tenant database system. A tenant-selective query syntax is determined by analyzing at least one of metadata generated from information about the tenant or metadata generated from the data accessible by the tenant.

Abstract: Approaches, techniques, and mechanisms are disclosed for ensuring that a database command is executed according to a query plan that has been verified to be actually optimal. Except in rare circumstances, a database server does not execute a query plan unless it is first verified by the database server. The database server receives a request to execute a database command. The database server determines an unverified plan is the best plan for satisfying the request. Rather than risk the unknown behavior of an unverified plan, the database server instead satisfies the request according to a verified plan. Subsequently—for example as part of a scheduled job—the database server executes the unverified plan to determine performance statistics. Based at least on the performance statistics, the database server determines whether or not to verify the unverified plan. Techniques for concurrent and optimistic verifications are also disclosed.

Abstract: Methods 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 methods 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: A method and system for managing searches of a data set that is partitioned based on a plurality of events. A structure of a search query may be analyzed to determine if logical computational actions performed on the data set is reducible. Data in each partition is analyzed to determine if at least a portion of the data in the partition is reducible. In response to a subsequent or reoccurring search request, intermediate summaries of reducible data and reducible search computations may be aggregated for each partition. Next, a search result may be generated based on at least one of the aggregated intermediate summaries, the aggregated reducible search computations, and a query of adhoc non-reducible data arranged in at least one of the plurality of partitions for the data set.

Abstract: In an on demand database system, a query engine applies a custom index for inner queries. The query engine receives a query and determines that the query has an inner query nested within the primary query. The query engine identifies that a custom index exists for a client associated with the query, and applies the custom index to filter results for the query. The custom index includes a subset of information of a table that includes accounts for multiple different clients. By using the custom index, the query engine can filter the results more efficiently that if solely using the multiple client table.

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: 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: 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: 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: 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: 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: 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.