Class / Patent application number | Description | Number of patent applications / Date published |
707715000 | Based on index optimization | 81 |
20100057796 | INDEX SELECTION IN A DATABASE SYSTEM - An index selection mechanism allows for efficient generation of index recommendations for a given workload of a database system. The workload includes a set of queries that are used to access tables in a database system. The index recommendations are validated to verify improved performance, followed by application of the indexes. Graphical user interface screens are provided to receive user input as well as to present reports to the user. | 03-04-2010 |
20100100538 | METHOD AND APPARATUS FOR OPTIMIZING QUERIES UNDER PARAMETRIC AGGREGATION CONSTRAINTS - The present invention relates to a method and apparatus for optimizing queries. The present invention discloses an efficient method for providing answers to queries under parametric aggregation constraints. | 04-22-2010 |
20100106711 | COMBINED JOIN - Computer-implemented systems and associated operating methods perform a combined join. A computer-implemented system comprises a processor that performs query processing in a relational database by receiving inputs of a variety of cases and sizes, and performing a combined database join of two of the received inputs using an index in memory formed from records of the first input and probed with records from the second input by optimizing the index for increased-speed searching using fast parent-to-child navigation. The variety of cases comprise combinations of unsorted, sorted, and indexed inputs, and the variety of sizes comprise input sizes from smaller than the available memory to input sizes substantially larger than available memory. | 04-29-2010 |
20100106712 | SEARCH SYSTEM - Documents, which have typically been searched for using multiple search engines based on the access rights of multiple accounts on multiple authentication servers, are searched for using a single federated search engine via a single log in. A host system having an account correspondence database is provided with a function of re-indexing indexes that have been individually created with multiple search engines, so that indexes of all of the search engines are created in advance. When a search is requested, correspondence information is read from the account correspondence database, so that a document search involving the use of only the host system is executed based on all of the relevant account rights. | 04-29-2010 |
20100121838 | INDEX OPTIMIZATION FOR RANKING USING A LINEAR MODEL - Technologies are described herein for providing a more efficient approach to ranking search results. An illustrative technology reduces an amount of ranking data analyzed at query time. In the technology, a term is selected, at index time, from a master index. The term corresponds to a number of documents greater than a threshold. A set of documents that includes the term is selected based on the master index. A rank is determined for each document in the set of documents that contains the term. Each document in the set of documents that contains the term is assigned to a top document list or a bottom document list based on the rank. Predefined values of at least part of the rank are stored in the top document list for documents in the top document list and are not stored in the bottom document list for documents in the bottom document list. | 05-13-2010 |
20100145931 | SYSTEM AND METHOD FOR INDEXING, SEARCHING AND RETRIEVING SEMANTIC OBJECTS - A method and structure for storing information for one or more semantic objects derived from raw data. A semantic object extracted from the raw data and classified to comprise the semantic object is received, the received semantic object having one or more attributes. A summary of attributes of the semantic object by calculating one or more statistics of one or more of the one or more attributes of the received semantic object, a confidence level of the received semantic object that quantifies a degree of certainty that the received semantic object has been correctly classified and/or labeled; and a compact representation of raw data of the received semantic object are generated. Indexing information for one or more of the summary of attributes and the compact representation of the semantic object is generated. The semantic object, along with its associated summary of attributes, confidence level, compact representation, and indexing information, stored in a semantic object database associated with a database storing the raw data. | 06-10-2010 |
20100205172 | METHOD FOR USING DUAL INDICES TO SUPPORT QUERY EXPANSION, RELEVANCE/NON-RELEVANCE MODELS, BLIND/RELEVANCE FEEDBACK AND AN INTELLIGENT SEARCH INTERFACE - 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 ( | 08-12-2010 |
20100235348 | LOADING AN INDEX WITH MINIMAL EFFECT ON AVAILABILITY OF APPLICATIONS USING THE CORRESPONDING TABLE - 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. | 09-16-2010 |
20100262593 | AUTOMATED FILTERED INDEX RECOMMENDATIONS - 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. | 10-14-2010 |
20100262594 | REDUCING ACCESS TIME FOR DATA IN FILE SYSTEMS WHEN SEEK REQUESTS ARE RECEIVED AHEAD OF ACCESS REQUESTS - 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. | 10-14-2010 |
20100281013 | ADAPTIVE MERGING IN DATABASE INDEXES - 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. | 11-04-2010 |
20100281014 | METHOD, SYSTEM, AND COMPUTER PROGRAM PRODUCT FOR QUERYING IN A MULTI-TENANT DATABASE - 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. | 11-04-2010 |
20110022582 | Indexing of Partitioned External Data Sources - 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. | 01-27-2011 |
20110055200 | METHOD AND APPARATUS FOR UTILIZING EXISTING HASH IDENTIFIERS OF DECISION DIAGRAMS - 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. | 03-03-2011 |
20110072004 | EFFICIENT XPATH QUERY PROCESSING - 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. | 03-24-2011 |
20110078135 | DATABASE INDEX MONITORING SYSTEM - 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. | 03-31-2011 |
20110082855 | MULTI-DIMENSIONAL ACCESS TO DATA - One embodiment includes dimensional columns of a database table that are mapped to filter columns. The filter columns are used to build an index which provides multi-dimensional access to the database table. | 04-07-2011 |
20110191323 | EFFICIENT MULTIPLE TUPLE GENERATION OVER STREAMING XML DATA - Methods and arrangements for extracting tuples from a streaming XML document. A query twig is applied to the XML document stream, tuples are extracted from the XML document stream based on the query twig, and a quantity of extracted tuples is limited via foregoing extraction of duplicate tuples extraction of tuples that do not satisfy query twig criteria. | 08-04-2011 |
20110246449 | IMPLEMENTING COMPOSITE CUSTOM INDICES IN A MULTI-TENANT DATABASE - 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 computer 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 a first two-column custom index. Metadata associated with the data accessible by the tenant is retrieved, using a processor of the server computer, wherein at least a portion of the data accessible by the tenant is stored in a common table within the multi-tenant database system. A tenant-selective query syntax is determined, using the processor, wherein determining comprises analyzing at least one of metadata generated from information about the tenant or metadata generated from the data accessible by the tenant. Finally, using the processor, an improved query is generated using the query syntax, wherein the improved query is based at least in part upon the original query and data stored in the first two-column custom index. | 10-06-2011 |
20110295838 | TRANSFORMING QUERIES IN A MULTI-TENANT DATABASE SYSTEM - In a method, system, and computer-readable medium having instructions for optimizing a query in a database system, a query request is received with a query predicate to filter data returned in response to the query request and the query predicate has a formula, the query request is transformed to a transformed query request by preprocessing the formula in the query predicate, and the query request is optimized using the transformed query request. | 12-01-2011 |
20120078879 | Multi-Dataset Global Index - A system and method is provided for partitioning a global index into multiple index datasets to house indexes and their index values. The index datasets may be stored in initialized physical index areas that are distinct from a standard physical index area. | 03-29-2012 |
20120124029 | CROSS MEDIA KNOWLEDGE STORAGE, MANAGEMENT AND INFORMATION DISCOVERY AND RETRIEVAL - A System, method and application for creating comprehensive multiple mixed media knowledge storage and management, discovery and retrieval utilizing novel indexing and querying applied to content from multiple media formats from disparate sources is disclosed. Depending on the media format the system breaks down the source information in any media into constituent units (“tokens”) using a reference corpus of labeled tokens (“training set”). The details of tokens are stored in an inverted index with available reference data such as location in the file, time, source file and additional information related to the token such as quantitative similarity to the best-match token(s) in the training set etc. During retrieval, a query comprising of single element in any media; a multimedia element or a combination of such elements including a sequence of such elements in a time line is similarly broken down into constituent units to generate a novel query structure. This enables discovery and retrieval of knowledge from multiple source documents in different media combined to provide results which could include prediction of events; discovery of events leading up to or contributing to an outcome of interest and retrieval of documents or sections thereof, all ordered by relevance depending on the query and its context. | 05-17-2012 |
20120130983 | EFFICIENT STRING PATTERN MATCHING FOR LARGE PATTERN SETS - A string matching system is described herein that provides for very fast and efficient pattern matching against large sets of certain types of pattern strings. If a set of pattern strings is comprised of strings that can be logically divided into segments, these pattern strings can be stored efficiently in a tree-like data structure, segment by segment, storing pattern-match syntax segments separately from literal string segments. After segmentation, individual match candidate strings are compared, segment by segment, against elements in the tree. The system uses a data structure that is conceptually a combination of a tree and a hash table. Using a hash table to implement the branching elements at each level in the tree contributes to quick matching speed at each level. By consistently separating strings into segments, the system can also share storage locations for like elements in the data structure. | 05-24-2012 |
20120130984 | DYNAMIC QUERY MASTER AGENT FOR QUERY EXECUTION - A preliminary segment root and a final segment root are selected for each segment. Each time a search query is received, a set of nodes in each segment that will be used to resolve the search query is identified. A preliminary segment root is selected from the set of nodes. Based on statistical data from each node in the set of nodes indicating each node's capability to act as a final segment root that assembles query-execution data, the preliminary segment root algorithmically selects the final segment root. The other nodes in the set of nodes are notified regarding the identity of the final segment root. | 05-24-2012 |
20120143846 | Providing Efficient Access to Redundant Number Representations - 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. | 06-07-2012 |
20120158696 | EFFICIENT INDEXING OF ERROR TOLERANT SET CONTAINMENT - The claimed subject matter provides a method and a system for the efficient indexing of error tolerant set containment. An exemplary method comprises obtaining a frequency threshold and a query set. All tokens or token sets within the query set are determined, and then all minimal infrequent tokens or all minimal infrequent tokens sets of data records are found and used to build an index. The minimal infrequent tokens or minimal infrequent tokensets are processed in a fixed order, and then a collection of signatures for each minimal infrequent token or token set is determined. | 06-21-2012 |
20120179668 | SEARCH INDEX FORMAT OPTIMIZATIONS - A search index structure which extends a typical composite index by incorporating an index which is optimized for fast retrieval from storage and which eliminates data which is specific to phrase searching. Other data is represented in a manner which allows it to be calculated rather than stored. Associating variable length entries with logical categories allows their length to be inferred from the category rather than stored. Using delta values between document IDs rather than the ID itself generates a compact, dense symbol set which is efficiently compressed by Huffman encoding or a similar compression method. Using an upper threshold to remove large, and thus rare, delta values from the symbol set prior to encoding further improves the encoding performance. | 07-12-2012 |
20120197869 | SYSTEM AND METHOD FOR EXECUTING QUERIES - 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. | 08-02-2012 |
20120265750 | AD HOC GEOSPATIAL DIRECTORY OF USERS IN A DISTRIBUTED AND DECENTRALIZED SYSTEM BASED ON OPTIMIZING SYMBOL MANIPULATION LANGUAGE-BASED EXECUTABLE APPLICATION - In one embodiment, a method comprises receiving from a user interface, by a computing device, a request for execution of at least one lambda function in an operation of a geospatial application, the geospatial application having lambda functions for operating on one or more entities of an ad hoc geospatial directory accessible by the computing device, the lambda functions having strongly typed definitions according to a prescribed symbol manipulation language that is a non-Turing complete language, that does not permit partial functions, and that is independent of any attribute of any computing system; optimizing execution by the computing device of the operation on the ad hoc geospatial directory; and the computing device returning to the user interface a response to the request based on the optimizing execution of the operation, the response including a data structure including at least one of the lambda functions for a corresponding at least one of generating a query of the ad hoc geospatial directory, modifying a state of at least a first of the entities, or accessing the first of the entities. | 10-18-2012 |
20120265751 | OPTIMIZING THE EXECUTION OF A QUERY IN A MULTI-DATABASE SYSTEM - 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. | 10-18-2012 |
20120278308 | CUSTOM SEARCH QUERY SUGGESTION TOOLS - Methods, systems, and apparatus, including computer program products, for generating search query suggestions directed to a particular website. In one aspect, a method includes receiving a first set of suggestion data defining custom suggestions for a first website. The first set of suggestion data includes one or more first n grams and one or more second n grams that each represent a selectable alternative to a first n gram. The method also includes generating a suggestion resource and providing a search query suggestion tool to the first website, the suggestion tool being configured to generate a search query input field for webpages on the first website, receive a query input entered in the search query input field, and request that one or more query suggestions be provided as selectable alternatives to the search query input. | 11-01-2012 |
20120303608 | METHOD AND SYSTEM FOR CACHING LEXICAL MAPPINGS FOR RDF DATA - Disclose is an improved approach for caching lexical values for RDF data. A compact, efficient resource ID to value mapping is stored in memory, where the cache is stored in memory such that the overhead of accessing and updating it is minimized. The advantage of this approach is improved query performance, since the database is performing less work with the in-memory RDF resource caching. In addition, throughput and performance of the database are also improved. | 11-29-2012 |
20120317095 | DETERMINING A DENSITY OF A KEY VALUE REFERENCED IN A DATABASE QUERY OVER A RANGE OF ROWS - 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. | 12-13-2012 |
20120323886 | System, Method and Apparatus for Electronically Searching for an Item - The present invention provides a system, method and apparatus for electronically searching for an item by receiving a search request comprising a requested category and one or more requested attributes of the item and storing the search request in a search index based on the requested category and the requested attribute(s). The search index includes one or more categories and each category is defined by a taxonomy of attributes. The search index is then searched for any previously stored search requests that match the requested category and the requested attribute(s), a result of the search is determined and a search response that includes the result of the search is sent. | 12-20-2012 |
20130013587 | INCREMENTAL COMPUTING FOR WEB SEARCH - Architecture that performs incremental computing for web searches by employing methods at least for storing the results of repeat queries on unchanged webpages and for computing results for the repeated queries. The architecture includes one or more algorithms for pre-computing query results on index servers, for only selectively choosing index servers whose result for a query change for a query computation process, and for re-using the unchanged web pages stored in the cache and computing results upon changed index and unchanged index separately. | 01-10-2013 |
20130041886 | METHODS FOR CALCULATING A COMBINED IMPACT ANALYSIS REPOSITORY - Methods for accessing impact analysis repositories and transaction-refinement index for each of the impact analysis repositories. According to the obtained transaction-refinement index, associating the combined repository with information from the most transaction refined impact analysis repository. Associating the combined repository with information from the less transaction refined impact analysis repository in the case of a request to insert or delete a table record for tables that do not contain any impacted transaction in the more transaction refined impact analysis repository. And associating the combined repository with information from the less transaction refined impact analysis repository in the case of a request to update a table record for table columns that do not contain any impacted transaction in the more transaction refined impact analysis repository. | 02-14-2013 |
20130060752 | USING A PARTIALLY BUILT INDEX IN A COMPUTER DATABASE SYSTEM - A partially built index is used in a computer database system. When a database index is being built, or rebuilt, the database manager keeps track of the records processed using a relative row number (RRN) to track what part of the partially built index is complete. Queries are optimized by a query optimizer associated with the database manager that uses the portion of the index that is complete with reference to the RRN. The remainder of the database table beyond the RRN can be estimated or implemented using the completed data or can be determined by searching the relevant portion of the database table. | 03-07-2013 |
20130066850 | USING A PARTIALLY BUILT INDEX IN A COMPUTER DATABASE SYSTEM - A partially built index is used in a computer database system. When a database index is being built, or rebuilt, the database manager keeps track of the records processed using a relative row number (RRN) to track what part of the partially built index is complete. Queries are optimized by a query optimizer associated with the database manager that uses the portion of the index that is complete with reference to the RRN. The remainder of the database table beyond the RRN can be estimated or implemented using the completed data or can be determined by searching the relevant portion of the database table. | 03-14-2013 |
20130086038 | PROVISION OF INDEX RECOMMENDATIONS FOR DATABASE ACCESS - 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. | 04-04-2013 |
20130091121 | Method for rapid assessment of similarity between sequences - 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. | 04-11-2013 |
20130138629 | INDEX-BASED EVALUATION OF PATH-BASED QUERIES - 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. | 05-30-2013 |
20130159281 | EFFICIENT QUERYING USING ON-DEMAND INDEXING OF MONITORING TABLES - 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. | 06-20-2013 |
20130159282 | DETERMINING A DENSITY OF A KEY VALUE REFERENCED IN A DATABASE QUERY OVER A RANGE OF ROWS - 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. | 06-20-2013 |
20130179433 | DATABASE QUERY OPTIMIZATION USING INDEX CARRYOVER TO SUBSET AN INDEX - 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. | 07-11-2013 |
20130262434 | QUERYING SPATIAL EVENTS IN A VEHICLE NETWORK, AND OPTIMIZED QUERIER - 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. | 10-03-2013 |
20130304722 | RANGE QUERY METHODS AND APPARATUS - 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. | 11-14-2013 |
20140081949 | DATA PROCESSOR, DATA MANAGEMENT SYSTEM, DATA PROCESSING METHOD, AND COMPUTER PROGRAM PRODUCT - 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. | 03-20-2014 |
20140081950 | INNER QUERY JOINS - 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. | 03-20-2014 |
20140114951 | DATABASE PERFORMANCE ESTIMATION DEVICE AND DATABASE ESTIMATION METHOD - 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. | 04-24-2014 |
20140143229 | METHOD AND SYSTEM FOR PROCESSING IMAGES - 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. | 05-22-2014 |
20140164354 | OPTIMIZED QUERY ORDERING FOR FILE PATH INDEXING IN A CONTENT REPOSITORY - 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. | 06-12-2014 |
20140201189 | SYSTEM AND METHOD FOR EXECUTING QUERIES - 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. | 07-17-2014 |
20140207754 | Gathering Index Statistics Using Sampling - 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. | 07-24-2014 |
20140258264 | MANAGEMENT OF SEARCHES IN A DATABASE SYSTEM - 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. | 09-11-2014 |
20140317086 | Efficient Database Searching - Systems and methods are disclosed for efficiently searching a database including a table. The table is partitioned along a first dimension, such as latitude. Indexes in each of the partitions are built along a second dimension, such as longitude. The table may also be clustered according to an index to improve performance. When a processor receives a database query term and a starting location, the processor selects, from the table, a data partition within a first offset to the starting location along the first dimension. The processor selects, from the selected data partition, a first number of first data records related to the query term and within a second offset to the starting location along the second dimension. | 10-23-2014 |
20140317087 | SYSTEMS AND METHODS FOR IMPLEMENTING AND MAINTAINING SAMPLED TABLES IN A DATABASE SYSTEM - In accordance with disclosed embodiments, there are provided systems and methods for implementing and maintaining sampled tables in a database system. According to a particular embodiment such a system includes a processor and a memory to execute instructions at the system; a database to store database records; a query interface to submit queries to the database and receive results from the database; triggers to initiate a hash function on database insert transactions, the hash function to hash a primary key of each database record to be inserted into the database to determine whether a first hash value of the primary key of the database record to be inserted satisfies a sampling condition; a sample table to store a sample record corresponding to any database record to be inserted into the database which satisfies the sampling condition based on the hash function; a primary key index providing a first index of the primary keys of the sample records stored in the sample table; and an ordered hash index providing a second index on a second hash value corresponding to a second hash of the primary key of the sample records stored in the sample table ordered numerically by the second hash value. Other related embodiments are disclosed. | 10-23-2014 |
20140324821 | ACCESSING DATA IN A COLUMN STORE DATABASE BASED ON HARDWARE COMPATIBLE INDEXING AND REPLICATED REORDERED COLUMNS - Embodiments of the present invention provide hardware-friendly indexing of databases. In particular, forward and reverse indexing are utilized to allow for easy traversal of primary key to foreign key relationships. A novel structure known as a hit list also allows for easy scanning of various indexes in hardware. Group indexing is provided for flexible support of complex group key definition, such as for date range indexing and text indexing. A Replicated Reordered Column (RRC) may also be added to the group index to convert random I/O pattern into sequential I/O of only needed column elements. | 10-30-2014 |
20140324822 | VIRTUAL ENVIRONMENT SPANNING DESKTOP AND CLOUD - A method and system are given for providing a virtual environment spanning a desktop and a cloud. In one example, the method includes receiving a query template over a data set that resides in the cloud, optimizing the query template to segment the query template into an offline phase and an online phase, executing the offline phase on the cloud to build one or more indexes, and sending the one or more indexes to the desktop. | 10-30-2014 |
20140351238 | REDUCING LAG TIME WHEN SEARCHING A REPOSITORY USING A KEYWORD SEARCH - Embodiments of the invention provide systems and methods for searching a repository of information such as a database using a keyword search and/or an attribute search in near real time. According to one embodiment, a method of searching a repository of information can comprise receiving a set of search criteria for performing the search and selectively performing one or more of an attribute search and a keyword search of the information in the repository based on the received search criteria. | 11-27-2014 |
20140372408 | SPARQL QUERY OPTIMIZATION METHOD - Prior to query execution a compressed table and compressed RDF data are created by use of: RDF data stored in an external storage device; and a compression reference table entered from an input device. The compression reference table is used to create a compressed query from an original query entered from the input device, and the compressed RDF data is searched to generate a variable biding table. An expanded query having a node added thereto is next created by use of the original query and the variable binding table, the node restricting a variable value range. The expanded query and the original RDF data are used to generate a query execution result at last. | 12-18-2014 |
20150066899 | SEARCH INDEX FORMAT OPTIMIZATIONS - A search index structure which extends a typical composite index by incorporating an index which is optimized for fast retrieval from storage and which eliminates data which is specific to phrase searching. Other data is represented in a manner which allows it to be calculated rather than stored. Associating variable length entries with logical categories allows their length to be inferred from the category rather than stored. Using delta values between document IDs rather than the ID itself generates a compact, dense symbol set which is efficiently compressed by Huffman encoding or a similar compression method. Using an upper threshold to remove large, and thus rare, delta values from the symbol set prior to encoding further improves the encoding performance. | 03-05-2015 |
20150081667 | APPARATUS AND METHOD FOR ANALYZING QUERY OPTIMIZER PERFORMANCE - A method of analyzing the performance of a query optimizer includes identifying an event trigger. A reproduction object characterizing operational parameters of the customer computer at the time of the event trigger is populated. The reproduction object is transported from the customer computer to a test computer. The reproduction object is analyzed at the test computer to characterize the performance of a query optimizer. | 03-19-2015 |
20150356137 | Systems and Methods for Optimizing Data Analysis - Methods and systems are provided for optimizing data analysis. An example method for optimizing a computer for performing queries of a database can include determining a number of distinct members in a lowest hierarchy level of each hierarchy dimension and determining a unique hierarchy identifier for such distinct member; determining the hierarchy dimension with the fewest number of distinct members in its lowest level; ranking the hierarchy dimensions by the number of distinct members in the lowest level; generating a first hypergraph tree for the hierarchy dimension with the fewest number of distinct members in its lowest level; and generating an additional hypergraph tree for a hierarchy dimension having more than the fewest number of distinct members in its lowest level. Each hypergraph tree includes multiple nodes and each node corresponds to one of the unique hierarchy identifiers. The additional hypergraph tree includes fewer tiers than the first hypergraph tree. | 12-10-2015 |
20150370896 | RECONCILING QUERY RESULTS ASSOCIATED WITH MULTIPLE INDICES - Systems, methods, and computer-readable storage media are provided for reconciling query results associated with multiple indices. A search query having a first spelling is received. A plurality of query results is determined, each query result being derived from one of a plurality of indices. At least a first index is associated with a lexicon that is specific to a user computing device and at least a second index is associated with a lexicon that is specific to web-based content. Each query result may be a query result determined based upon the first spelling for the search query, a suggested alternate spelling for the received search query, a query result determined based upon the suggested alternate spelling for the received search query, or a null result. One or more of the query results then is selected as responsive to the received search query. | 12-24-2015 |
20150379073 | VIRTUAL SPLIT DICTIONARY FOR SEARCH OPTIMIZATION - An attribute vector including value identifiers and corresponding to a dictionary structure is identified. A dictionary type encoding structure is generated by virtually partitioning the dictionary structure. The dictionary type encoding structure may include multiple dictionary types. Based on the dictionary encoding structure, the attribute vector may be split to generate multiple attribute vector blocks that may be identified by block transition indices. Based on the dictionary types in the dictionary encoding structure, the value identifiers in the attribute vector blocks are rearranged. Such a rearrangement optimizes the attribute vector for searching the value identifiers. | 12-31-2015 |
20160019249 | SYSTEM AND METHOD FOR OPTIMIZING STORAGE OF MULTI-DIMENSIONAL DATA IN DATA STORAGE - This technology relates to method and optimization systems for optimizing storage of multi-dimensional data in data storage. The method comprises analyzing a plurality of queries received over period of time from one or more client machines. Then, a query pattern is determined from plurality of queries. Based on query pattern dimensionality of data is identified for determining data storage strategy. The dimensionality is characterized into 11 dimensions comprising 4 standard level dimensions and 7 higher level dimensions. A highest dimension out of 7 higher dimensions is parallel data storage dimension. Based on storage strategy, at least one of data and columns of a table is segmented in data storage. Next, data is stored in remote data storage when data is an element of last higher level dimension. Then, higher level dimensions are fragmented into one or more smaller level dimensions when data is element greater than 11 dimensions. | 01-21-2016 |
20160026718 | Optimization of Query Execution - Various embodiments are disclosed for optimizing the execution of a query to retrieve data associated with multiple entities from a database server system, where the entities are associated with a user of a social networking system. At least one embodiment includes analyzing parameters of the query to identify one or more databases at which to execute the query, determining whether to execute constraint type parameters on the data retrieved at a frontend or backend server of the server system, and separating the performance of privacy checks on the data retrieved from the execution of the query. The embodiment further includes executing, based on the databases identified, the query in parallel threads to retrieve individual data sets of a result set, where a particular individual data set is associated with a particular entity. | 01-28-2016 |
20160092484 | DATA INGESTION STAGER FOR TIME SERIES DATABASE - A time series data stager that receives input data sets and outputs output data blocks for ingestion into a time series database, with the out data blocks being sent at timings according to a sliding window based on a predetermined time. | 03-31-2016 |
20160092541 | Database Management Method and System - A database management method and system. The method includes dividing, by a database system, a data partition into a physical partition layer and a logical partition layer, wherein the logical partition segment and the physical partition segment are mapped to each other using a mapping relationship; receiving, by the database system, a data operation instruction of a user, and determining a logical partition segment to which a data record that is requested for operation by the data operation instruction belongs; determining, according to the data operation instruction and the mapping relationship, a physical partition segment that is corresponding to the determined logical partition segment and at the physical partition layer to perform an operation on the data record that is requested for operation by the data operation instruction. | 03-31-2016 |
20160110393 | DATABASE INDEXES - A method and system for database indexing, wherein a database index comprises at least one index include. The method and system includes obtaining the number of executions of each of a plurality of Structured Query Language (SQL) statements within a certain time period, respectively, wherein the plurality of SQL statements use the database index. For each of the at least one index include, calculating a number of hits of the index include according to the number of executions of each of the plurality of SQL statements. Further, obtaining a length of the index include, and calculating a hit frequency of the index include by using the number of hits and the length of the index include. The hit frequency equals the number of hits divided by the length. | 04-21-2016 |
20160171047 | DYNAMIC CREATION AND CONFIGURATION OF PARTITIONED INDEX THROUGH ANALYTICS BASED ON EXISTING DATA POPULATION | 06-16-2016 |
20160171071 | DYNAMIC CREATION AND CONFIGURATION OF PARTITIONED INDEX THROUGH ANALYTICS BASED ON EXISTING DATA POPULATION | 06-16-2016 |
20160188667 | SYSTEMS AND METHODS FOR ENHANCING SEARCH RESULTS BY WAY OF UPDATING SEARCH INDICES - Systems and methods are described herein for efficiently providing personalized search results to a user. Personalized search allows a user to receive search results that are most relevant to that user. For example, when a user with a strong interest in rap searches for “50 cent” they may be presented with top search results corresponding to 50 Cent's rap albums. Conversely, when a coin collector searches for “50 cent” they may be presented with top search results containing antique coins. | 06-30-2016 |
20160378804 | BIT VECTOR ROW TRIMMING AND AUGMENTATION FOR MATCHING DOCUMENTS - The technology described herein provides for identifying matching documents for a search query using a bit vector search index. When a search query is received, a term is identified from the search index, and a number of bit vectors corresponding to the term are identified. Each bit vector comprises an array of bits in which at least one bit in each bit vector indicates that a corresponding document includes the term. Each bit vector also includes other bits indicating other documents include other terms. A determination is made regarding which bit vectors for the term to use for the matching process. The selected bit vectors are intersected to identify matching documents that contain the term. | 12-29-2016 |
20160378805 | MATCHING DOCUMENTS USING A BIT VECTOR SEARCH INDEX - The technology described herein provides for identifying matching documents for a search query using a bit vector search index. When a search query is received, a term is identified from the search index, and a number of bit vectors corresponding to the term are identified. Each bit vector comprises an array of bits in which at least one bit in each bit vector indicates that a corresponding document includes the term. Each bit vector also includes other bits indicating other documents include other terms. The identified bit vectors are intersected to identify matching documents that contain the term. | 12-29-2016 |
20160378806 | REDUCING MATCHING DOCUMENTS FOR A SEARCH QUERY - The technology described herein provides for identifying matching documents for a search query using a bit vector search index. When a search query is received, a term is identified from the search index, and a number of bit vectors corresponding to the term are identified. Each bit vector comprises an array of bits in which at least one bit in each bit vector indicates that a corresponding document includes the term. Each bit vector also includes other bits indicating other documents include other terms. A determination is made that an unacceptable number of possible matching documents is likely to be returned. In response to the determination, a strengthening row bit vector is selected to reduce the number of possible matching documents. The identified bit vectors and the selected strengthening row are intersected to identify matching documents that contain the term. | 12-29-2016 |
20160378807 | STORAGE AND RETRIEVAL OF DATA FROM A BIT VECTOR SEARCH INDEX - The technology described herein provides for storing and retrieving data in a bit vector search index. The bit vector search index stores data about terms from documents using bit vectors. Each bit vector comprises an array of bits and corresponds to a different set of terms. Each bit in the bit vector is used to represent whether a document includes at least one term from the set of terms. A band table is used to store bit vector configurations for bands of terms having similar term characteristics. Each term is indexed in the bit vector search index according to a bit vector configuration for a band to which it belongs. When identifying bit vector storage locations for terms, explicit mappings are used for some terms and ad hoc approaches used for other terms. Explicit mappings provide specific locations for terms, while ad hoc approaches use mapping algorithms assigned to bands. | 12-29-2016 |
20160378822 | AUTOMATED RECOMMENDATION AND CREATION OF DATABASE INDEX - A system that automatically formulates recommendations or suggestions for creating indexes on database entities that will improve the overall query performance of a database and/or collection of databases for those queries that target a database entity for which index creation is recommended. A gathering module gathers at least a portion of historical data automatically generated by the database or database collection. An index recommendation module uses the gathered historical data to generate recommended indexing tasks on the basis of estimated greatest impact on overall query performance. An index creation module then initiates an indexing task of the generated set of one or more recommended indexing tasks to thereby create at least one corresponding index on at least one corresponding database entity to thereby improve overall query performance on the database or database collection. | 12-29-2016 |
20160378824 | Systems and Methods for Parallelizing Hash-based Operators in SMP Databases - A system and method for parallelizing hash-based operators in symmetric multiprocessing (SMP) databases is provided. In an embodiment, a method in a device for performing hash based database operations includes receiving at the device an database query; creating a plurality of execution workers to process the query; and building by the execution workers a hash table from a database table, the database table comprising one of a plurality of partitions and a plurality of scan units, the hash table shared by the execution workers, each execution worker scanning a corresponding partition and adding entries to the hash table if the database table is partitioned, each execution worker scanning an unprocessed scan unit and adding entries to the hash table according to the scan unit if the database table comprises scan units, and the workers performing the scanning and the adding in a parallel manner. | 12-29-2016 |
20180025054 | EVENT-DRIVEN ARCHITECTURE USING ROLLING AGGREGATES | 01-25-2018 |
20190146985 | NATURAL LANGUAGE QUESTION ANSWERING METHOD AND APPARATUS | 05-16-2019 |