| Entries |
| Document | Title | Date |
|---|
| 20100100533 | Cascade Delete Processing - A time-efficient means for identifying and processing cascading deletes due to referential constraint violations includes: logging, to an error file, all primary key (“PK”) errors detected during table load operations; building a foreign key (“FK”) index for each child table; recursively probing each relevant FK index to identify all loaded rows that violate a referential constraint due to a PK error; logging all identified FK errors to the error file; and using the (preferably sorted) error file contents to identify, mark and physically delete table rows that violate a referential constraint. The described cascade delete processing methods make only a single pass through the table data, using ordinary computer files to track and organize rows identified for deletion. Use of error files rather than tablescans (multiple passes through the loaded table data) can provide a significant reduction in table load times, especially for large or intricately “related” tables. | 04-22-2010 |
| 20100106695 | SCALABLE BLOB STORAGE INTEGRATED WITH SCALABLE STRUCTURED STORAGE - Embodiments of the present invention relate to systems, methods and computer storage media for facilitating the structured storage of binary large objects (Blobs) to be accessed by an application program being executed by a computing device. Generally, the structured storage of Blobs includes a primary structured storage index for indexing Blobs, a secondary hash index that is integrated into the structured storage system, a Blob log stream, and a Blob data stream for storing blocks that include the Blob data. In an embodiment, a block is created and written to a Blob store along with a block list. The block list facilitates the locating of one or more blocks that store the Blob data. In this embodiment, a primary structured storage index and a secondary hash index are updated to facilitate efficient access of the Blob in a structured storage system. | 04-29-2010 |
| 20100131479 | METHOD AND APPARATUS FOR CHANGING REFERENCE OF DATABASE - Introduced is information that indicates a changing of “a reference that points a referenced record” to “another reference that points another record”. This information is named as “changing reference information (CRI)” and is registered to a referred record. When accessing a referencing record, there is a possibility to access referenced record by necessity of a program or an operator. At this time, CRI registered to originally referenced record is accessed. And the reference is changes to new record as indicated by the CRI. Thus, status of a DB in a device is changed by the invention. When PCs have reproduced DBs that are copy of the original and edit their own reproduced DBs so as to change a reference, these editorial contents with CRI will be propagated to other PCs. Other PCs change references of their reproduced DBs according to the CRIs. | 05-27-2010 |
| 20100138399 | METHOD FOR DATA ENCRYPTION AND METHOD FOR DATA SEARCH USING CONJUNCTIVE KEYWORD - The present invention relates to a method for data encryption and a method for data search using a conjunctive keyword and more particularly to, a method for searching data stored in a server by using a conjunctive keyword after storing an index table for the conjunctive keyword and encrypted data in the server. According to an embodiment of the present invention, since keywords and relevant data do not need to be searched one by one by performing a conjunctive keyword search by using a linked tree structure modifying a linked list, it is possible to perform a rapid and efficient conjunctive keyword search. | 06-03-2010 |
| 20100145918 | SYSTEMS AND METHODS FOR INDEXING CONTENT FOR FAST AND SCALABLE RETRIEVAL - Systems and methods for generating a document identifier, for a document received at a content store, to be used to generate at least one posting list in connection with querying a content store is described. | 06-10-2010 |
| 20100161569 | METHOD AND SYSTEM FOR DYNAMICALLY PARTITIONING VERY LARGE DATABASE INDICES ON WRITE-ONCE TABLES - Methods and systems for partitioning and dynamically merging a database index are described. A database index includes a single first-level index partition stored in a data cache. As the first-level index partition in the data cache reaches a predetermined size, it is copied to secondary storage and a new index partition is generated in the data cache. When the number of index partitions in secondary storage reaches some predetermined number, the index partitions are merged to create a single index partition of a higher level in a hierarchy of index partitions having an exponentially increasing size with each increase in level within the hierarchy. | 06-24-2010 |
| 20100161570 | Scope Based Indexing Prioritization - Methods and systems provide a tool for prioritizing the ordering of outstanding indexing work in order to bring a particular portion of an indexing source up to date quickly and to reduce the likelihood of inconsistencies between an index-backed view and a direct view of a source. In accordance with the described embodiments, indexing of items can be prioritized based upon a user's view or metadata contained within a query. Further, in at least some embodiments, the tool can decide the order to index items based upon multiple prioritization requests. | 06-24-2010 |
| 20100174691 | METHODS, SYSTEMS, AND COMPUTER PROGRAM PRODCUT FOR AUTOMATICALLY CATEGORIZING DEFECTS - Disclosed are method(s), system(s), and computer program product(s) for automatically categorizing a defect into a category based at least on a keyword related to the defect. In some embodiments, the method or the system identifies an information regarding the defect and identifies or receives additional information related to categorizing the defect. In some embodiments, the method or the system identifies a keyword for the defect based on the first information and determines whether the defect may be categorized into a category using the keyword. In some embodiments, the method or the system further comprises determining whether the result of categorization is deterministic. In some embodiments, the method or the system further comprises associating a first score for categorizing the defect into the category based on the keyword and a second score for categorizing the defect into the category based on another keyword. In some embodiments, the method or the system further comprises identifying or determining a functional describing a relationship between the first some and the second score with respect to the first category for the defect. | 07-08-2010 |
| 20100174692 | GRAPH STORE - A new database design is implemented in which everything in the database is modeled with primitives, including the links and nodes for a graph tuple store. A query syntax provides a nested tree of constraints with a single global schema. Various optimization techniques for queries and replication techniques are also described. | 07-08-2010 |
| 20100198798 | APPARATUS AND METHOD FOR STORING AND READING A FILE HAVING A MEDIA DATA CONTAINER AND A METADATA CONTAINER - A concept is disclosed for outputting a file having a media data container and a metadata container, the concept including providing an error information related to a data sample and storing the error information together with a sample number related to the data sample in the metadata container. | 08-05-2010 |
| 20100205160 | UPDATING AN INVERTED INDEX IN A REAL TIME FASHION - Systems and methods for regularly updating portions of a merged index are provided. Initially, upon receiving an indication that modifications have occurred to content of web-based documents, dynamic update of index (DUI) objects that identify the documents and expose the modified content are composed by ascertaining relative positions of the modified content within the documents, and packaging identifiers of the documents, the relative positions, and metadata underlying the modified content into a message. The DUI objects are applied to an overloading index that maintains structured records of recent modifications. In particular, portions of the overloading index are targeted utilizing the document identifiers and the relative positions specified by the DUI object, thereby updating the targeted portions within the overloading index corresponding to the modified content without rewriting the entire overloading index. Periodically, an association process is invoked for grouping the merged index with the overloading index for search purposes. | 08-12-2010 |
| 20100217754 | METHOD AND APPARATUS FOR MANAGING BOOKMARK INFORMATION FOR CONTENT STORED IN A NETWORKED MEDIA SERVER - A method and apparatus for managing bookmark information of a media server through a network based on the UPnP AV standard is disclosed. If a request for bookmarking a content item is made, a bookmark item is created and the created bookmark item is linked to the content item by adding the ID of the created bookmark item to the property information of the content item and recording the ID of the content item to be bookmarked in the created bookmark item. | 08-26-2010 |
| 20100223240 | SYSTEM AND METHOD FOR COMPOSITE RECORD KEYS ORDERED IN A FLAT KEY SPACE FOR A DISTRIBUTED DATABASE - An improved system and method for composite record keys ordered in a flat key space for a distributed database is provided. A data schema may be created that defines a composite record key for data records in a canonical form. Composite record keys may then be constructed in canonical form defined by the data schema for each data record in data tables of a distributed database. An ordered index of composite record keys may then be built by inserting the composite record keys in canonical form into the index in sorted order. The index of composite record keys ordered in a flat key space for a distributed database may then be used for efficiently comparing or sorting distributed data records in the distributed database. The composite record keys ordered in a flat key space may be compared or sorted without referencing the data schema of the composite record keys. | 09-02-2010 |
| 20100250504 | DYNAMIC INTEGRATED DATABASE INDEX MANAGEMENT - Integral index management for a relational database is provided. Possible index management actions are identified to an administrator, and index management metric thresholds are provided by the administrator. An index metrics collection module automatically collects metric values. An index metrics analysis module automatically determines whether collected metric values satisfy specified thresholds. An index management action implementation module then implements index management actions, such as reorganizing or rebuilding indexes, adding indexes, and removing indexes. Threads may work in parallel on multiple tables of the relational database. Proposed actions may be subject to final authorization or may be implemented automatically after the metric threshold values are satisfied. | 09-30-2010 |
| 20100281005 | Asynchronous Database Index Maintenance - This disclosure provides techniques for asynchronously maintaining database indexes or sub-indexes. For example, a database management server may receive a data manipulation statement to modify particular data stored in a database and determine whether an index associated with executing the statement is maintained asynchronously. When the index is maintained asynchronously, maintenance of the index to reflect changes made to the particular data by executing the data manipulation statement may be delayed until an index maintenance event. The index maintenance may be based on an isolation level of a transaction including a query that triggered the index maintenance. | 11-04-2010 |
| 20100318502 | UPDATING FIRST DATA VALUE BEFORE SECOND DATA VALUE - A flag and a wait period are used to guarantee that readers of two data values see the updated first value before they see the updated second value, where the second value has to be updated after the first value is updated and thus is dependent on the first value. The first value is updated, and a flag associated with the first data value is set. The flag effectively prevents further updating of the first data value until it has been cleared. A length of time is waited for, such that any reading of the first data value and the second data value is guaranteed to not see the second data value as updated unless the first data value is also seen as updated. The flag is then cleared, such that further updating of the first data value can again occur. The second data value is finally updated. | 12-16-2010 |
| 20110029496 | Apparatus, System, and Method for Coordinating Storage Requests in a Multi-Processor/Multi-Thread Environment - An apparatus, system, and method are disclosed for coordinating storage requests in a multi-processor/multi-thread environment. An append/invalidate module generates a first append data storage command from a first storage request and a second append data storage command from a second storage request. The storage requests overwrite existing data with first and second data including where the first and second data have at least a portion of overlapping data. The second storage request is received after the first storage request. The append/invalidate module updates an index by marking data being overwritten as invalid. A restructure module updates the index based on the first data and updates the index based on the second data. The updated index is organized to indicate that the second data is more current than the first data regardless of processing order. The modules prevent access to the index until the modules have completed updating the index. | 02-03-2011 |
| 20110066603 | Time-Outs With Time-Reversed Linear Probing - A current key is received at a current arrival time at a computer. An index in an array corresponding to the current key is determined using a hash function. A previous key and a previous arrival time are retrieved from the array at the index. The array is transformed by replacing the previous key and the previous arrival time with the current key and the current arrival time in the array at the index. The previous key and the previous arrival time are inserted into a nearest eligible sequential index in the array. | 03-17-2011 |
| 20110113020 | MAINTAINING CONSISTENCY IN A DATABASE - Maintaining consistent DNS information is disclosed. Information associated with a resource is received. A resource record is populated with the information. View information is derived from the resource record. | 05-12-2011 |
| 20110153580 | Index Page Split Avoidance With Mass Insert Processing - A technique is disclosed that avoids index page splits when inserting large numbers of rows into a table of a relational database. Keys in index pages are moved to successive index pages to make room to insert keys on the original index page. Where no room is available on successive pages, a new index page is created to hold moved keys. The result is typically a smaller chain of index pages with better locality than using the conventional insertion technique of splitting index pages. | 06-23-2011 |
| 20110184923 | METHOD AND SYSTEM FOR DEFERRED MAINTENANCE OF DATABASE INDEXES - Rectifying discrepancies between a table, from which a segment of data has been removed, and an index for the table may be deferred. Each entry in the index is sequentially analyzed to remove entries therefrom referring to any removed segment referenced in the starting location list. During this process, if a segment newly removed from the table is detected, then analysis of the index entries continues and an indicator is set that another segment has been removed. Analysis of the entries continues in a looping fashion until each entry has been assessed to determine if it makes a reference to any of the removed segments. If a query is received before rectification is complete then the query is amended by establishing search boundaries based so that the query does not produce any entries in the index referring to removed segments. | 07-28-2011 |
| 20110208704 | HIERARCHICAL LOCKING IN B-TREE INDEXES - Portions of a B-tree index in a database are locked for concurrency control. In one example, hierarchical lock modes are provided that permit locking a key, a gap between the key and the next key, and a combination of the key and the gap. In another example, key range locking may be applied to the B-tree index using locks on separator keys of index nodes. In another example, key range locking may be applied to the B-tree index using locks on key prefixes. | 08-25-2011 |
| 20110238638 | METHODS AND SYSTEMS FOR OBTAINING AND CORRECTING AN INDEX RECORD FOR A VIRTUAL STORAGE ACCESS METHOD KEYED SEQUENTIAL DATA SET - According to one embodiment, a computer program product includes a computer readable storage medium having computer readable program code embodied therewith. The code is configured to: receive an index record including descriptions of data records, and determine if the index record is valid. For a valid index record, code is configured to locate a desired index entry from the valid index record, and to retrieve a last index entry of the valid index record. Also included in the computer program product is code configured to: read all data records to be described in a corrected index record, store a key and a location for each of the read data records, sort the read data records sequentially by key, create the corrected index record for all the read data records, and store the corrected index record. Other systems, computer program products, and methods are described as well. | 09-29-2011 |
| 20110289061 | REDISTRIBUTE NATIVE XML INDEX KEY SHIPPING - Techniques are described for data redistribution in a database system. Embodiments store a first set of receiver location identifiers mapped to a document identifier, the first set of receiver location identifiers assigned to a first set of receiver locations storing relational data referencing the document identifier. Embodiments further store a second set of receiver location identifiers mapped to the document identifier, the second set of receiver location identifiers assigned to a second set of receiver locations storing document data corresponding to the document identifier referenced by the relational data. Sender index keys are received separately from the relational data and the document data, the sender index keys referencing the document identifier and containing sender location identifiers. Embodiments determine, from the first set of receiver location identifiers and the second set of receiver location identifiers, which receiver location identifiers are mapped to the document identifier referenced by the sender index keys. The sender location identifiers are then replaced with the determined receiver location identifiers. | 11-24-2011 |
| 20120016851 | System and Method for Partially Deferred Index Maintenance - Methods and Apparatus, including computer program products, for maintaining indexes in a database management system. The database management system includes a table having table entries and an index data structure having index data structure entries, the index data structure relating to the table. The index data structure is updated synchronously with an insertion of table entries. The index data structure is maintained unchanged when the table entries are deleted. It is verified by an index-scan on the index data structure that a valid criterion is fulfilled for index data structure entries, and those index data structure entries that pass the valid criterion from the index-scan are returned. | 01-19-2012 |
| 20120023076 | AUTOMATED CHANGE APPROVAL - An automated method for facilitating management of a data processing environment is disclosed. In various embodiments, the method may include facilitating creation of a first memorialization, in digital form, of first one or more changes made to a first data processing device of the data processing environment. In various embodiments, the method may further include facilitating creation of a second and a third memorialization, both in digital form, of second and third one or more changes made to a second and a third data processing device of the data processing environment, respectively. In various embodiments, the method may still further include facilitating automated approval of the second and third changes made to the second and third data processing devices, using the first, second and third memorializations. Other embodiments of the present invention may include, but are not limited to, apparatus adapted to facilitate practice of the above-described method. | 01-26-2012 |
| 20120047115 | EXTENT REFERENCE COUNT UPDATE SYSTEM AND METHOD - Systems and methods for extent reference count updates are presented. In one embodiment; a reference count update method includes: receiving an indication of new reference association with an extent of a shared storage component; generating reference count update log information for a reference count update log to indicate the new reference association with an extent of a shared storage component, wherein the altering occurs inline; forwarding a successful data update indicator to initiator of activity triggering the new reference association with the extent of the shared storage component; and updating a reference count table in accordance with the information in the reference count update log, wherein the updating is included in a background process. | 02-23-2012 |
| 20120059806 | UPDATING AN INVERTED INDEX IN A REAL TIME FASHION - Systems and methods for regularly updating portions of a merged index are provided. Initially, upon receiving an indication that modifications have occurred to content of web-based documents, dynamic update of index (DUI) objects that identify the documents and expose the modified content are composed by ascertaining relative positions of the modified content within the documents, and packaging identifiers of the documents, the relative positions, and metadata underlying the modified content into a message. The DUI objects are applied to an overloading index that maintains structured records of recent modifications. In particular, portions of the overloading index are targeted utilizing the document identifiers and the relative positions specified by the DUI object, thereby updating the targeted portions within the overloading index corresponding to the modified content without rewriting the entire overloading index. Periodically, an association process is invoked for grouping the merged index with the overloading index for search purposes. | 03-08-2012 |
| 20120143835 | EFFICIENT CONSTRUCTION OF SYNTHETIC BACKUPS WITHIN DEDUPLICATION STORAGE SYSTEM - Various embodiments are provided for facilitating construction of a synthetic backup in a deduplication storage system. In one embodiment, a deduplication storage system enables new input data to be deduplicated with data of synthetic backups already constructed, and for this purpose efficiently calculates deduplication digests for synthetic backups being constructed, based on already existing digests of data referenced by the synthetic backups. For each input data segment of the plurality of input data segments of a synthetic backup being constructed, a plurality of deduplication digests of stored data segments, referenced by the input data segment, is retrieved from an index. Each input data segment is partitioned into each of a plurality of fixed-sized data sub-segments. A calculation is performed producing a deduplication digest for a data sub-segment, where the calculation is based on the retrieved deduplication digests of the plurality of stored data sub-segments referenced by the input data sub-segment. | 06-07-2012 |
| 20120203747 | Method and System for Processing Information of a Stream of Information - The invention is directed to a computer-implemented process for processing information related to entities and said entities being contained in a stream of information, the entities being stored in resource directories of a system, each resource directory containing entities and being annotated with a version number modified with the addition of at least one new entity. The process comprises the steps of: retrieving a stream of information from different information sources; processing segments of information from the stream of information in accordance with entities of said resource directories; storing the segments of information with an annotation indicating which version of said resource directories was used for processing said information segment; updating at least one of the said resource directories with at least one new entity and updating the version number of said at least one resource directory; and—reprocessing the stored segments of information containing the annotation indicating said segments of information were processed with a previous version of the at least one resource directory. | 08-09-2012 |
| 20120246132 | MANAGING OVERFLOW ACCESS RECORDS IN A DATABASE - Overflow access records (OARs) are managed in a database system. An OAR is created in response to receiving an update command for a data record and to the updated data record generated by the update command not fitting onto the page in the table where the data record was stored. The OAR that is created includes an index counter that indicates a number of indexes associated with the table. When an OAR is accessed in response to a query command, an identifier of the accessed OAR is replaced in the index by an identifier of a data record pointed to by the OAR, and the index counter in the accessed OAR is changed by a predefined amount. When the index counter reaches a predefined value, the accessed OAR is removed from the table. | 09-27-2012 |
| 20120259823 | PARTITIONING A DIRECTORY WHILE ACCESSING THE DIRECTORY - A process for reading entries in a directory is initiated. A first index is maintained to indicate how far the read has progressed in the directory. If, during execution of the process, the directory is partitioned into subdirectories, then a second index is maintained for each of the subdirectories to indicate how far the read has progressed in each of the subdirectories. A third index that indicates how far the read has progressed in the partitioned directory is also maintained. | 10-11-2012 |
| 20120259824 | MAINTAINING INDEX DATA IN A DATABASE - In a particular embodiment, a method includes storing, at a staging table of a database, a data update generated based on a transaction performed with respect to a data table that is associated with one or more indexes. Each index of the one or more indexes is maintained externally to the database. The method further includes maintaining the data update at the staging table at least until index update data is received at the database. The index update data represents a modification, based on the data update, to a particular index of the one or more the indexes. | 10-11-2012 |
| 20120310907 | SCOPE BASED INDEXING PRIORITIZATION - Methods and systems provide a tool for prioritizing the ordering of outstanding indexing work in order to bring a particular portion of an indexing source up to date quickly and to reduce the likelihood of inconsistencies between an index-backed view and a direct view of a source. In accordance with the described embodiments, indexing of items can be prioritized based upon a user's view or metadata contained within a query. Further, in at least some embodiments, the tool can decide the order to index items based upon multiple prioritization requests. | 12-06-2012 |
| 20120323870 | Incremental Maintenance of Inverted Indexes for Approximate String Matching - In embodiments of the disclosed technology, indexes, such as inverted indexes, are updated only as necessary to guarantee answer precision within predefined thresholds which are determined with little cost in comparison to the updates of the indexes themselves. With the present technology, a batch of daily updates can be processed in a matter of minutes, rather than a few hours for rebuilding an index, and a query may be answered with assurances that the results are accurate or within a threshold of accuracy. | 12-20-2012 |
| 20130013575 | Time-Outs with Time-Reversed Linear Probing - A current key is received at a current arrival time at a computer. An index in an array corresponding to the current key is determined using a hash function. A previous key and a previous arrival time are retrieved from the array at the index. The array is transformed by replacing the previous key and the previous arrival time with the current key and the current arrival time in the array at the index. The previous key and the previous arrival time are inserted into a nearest eligible sequential index in the array. | 01-10-2013 |
| 20130018859 | Contact Management System and Method - A computer-implemented contact management method includes creating a contact record in a contact management system, generating a unique serial number corresponding to the contact record, conveying the serial number to a recipient, entering, by the recipient, the serial number into an internet-enabled computer application, requesting, by the application, the record from the contact management system corresponding to the serial number, and receiving data associated with the contact record. The received contact data may be automatically updated through an update function. A contact management system includes a data storage and a contact management server. A plurality of interne-enabled computer applications associated to the same user account may receive the same information using a synchronization function without further user input. | 01-17-2013 |
| 20130046742 | STORING RECORDS IN DATABASES IN A RANDOMIZED MANNER TO EFFECTIVELY UTILIZE DATABASE SERVERS - A method for effectively utilizing database servers. A middle tier system, interfacing between clients and a database system, receives requests to create, delete or update a record from a client. An index is used by the middle tier system to determine if a record previously exists, and if so, its current record location. In this manner, the middle tier system keeps track of the locations of the records stored in the databases. By keeping track of the data load, the middle tier system identifies the most available resource to store the records. When a record is to be created, deleted or updated, the middle tier system rebalances the load capability of the database servers by distributing the data across the databases in a randomized manner based on the server load. In this manner, changes to the server load are more effectively managed. | 02-21-2013 |
| 20130091110 | Recovery of Inconsistent Data in Databases - A mechanism is provided for efficiently searching a database for data associated with a key value that is unidentifiable in a set of nodes of the database. A request is received to retrieve data from the database, where the request specifies a searched-for key value that is unidentifiable in the set of nodes of the database. The data associated with the searched-for key value is identified in a lowest level node of the database between a current leftmost node and a current rightmost node. A key index is updated in at least one node of the database with the key index value associated with the data and identified from the lowest level node thereby making the searched-for key value identifiable within the at least one node. The data associated with the searched-for key value is then returned to a user. | 04-11-2013 |
| 20130097134 | SYSTEM AND METHOD FOR SUBJECT IDENTIFICATION FROM FREE FORMAT DATA SOURCES - A system and method for indexing and searching a free format data source is provided. Indexing the free format data source includes normalizing data from the free format data source and creating a master index based on the normalized data. The master index may be updated through synchronization with the free format data source when a change in the data occurs. A search query may be executed against the master index and/or one or more child indexes to search for records. The search query may be normalized and transformed before being executed. The master index may be replicated into the one or more child indexes for scaling and load balancing purposes. Searches may be performed by search agents in parallel at the master index and/or the child indexes. | 04-18-2013 |
| 20130151491 | SYSTEMS AND METHODS FOR IMPROVING DATABASE PERFORMANCE - Systems and methods for mapping and propagating a source dataset to a plurality of target tables in a target database are described herein. Embodiments include a physical database design with a template-based loader, and a method to propagate changes in the source dataset to a target database. Other embodiments include a database physical design with a plurality of small fact and summary tables. Still other embodiments include a method of extracting and loading data automatically into a target database, while simultaneously maintaining current summary tables. | 06-13-2013 |
| 20130151492 | INFORMATION PROCESSING SYSTEM - When an index is partitioned and managed in a plurality of indexes in a search system which deals with large amounts of data, the number of documents registered in each partitioned index may be varied, and inefficient data transfer may occur at the time of index reconfiguration when search nodes are added or deleted. In the present invention, mapping information is used to map search node IDs to slot regions obtained by equally partitioning a circular hash value space in which a start point and an end point of the hash value space are assumed to be identical, so that each document is mapped to each partitioned index. | 06-13-2013 |
| 20130179415 | Reducing Duplicate Information when Reporting System Incidents - A mechanism is provided for reducing duplicate information. Diagnostic data associated with a new incident that has occurred is received and at least one new incident dump file is created for the new incident that includes some or all of the diagnostic data. The diagnostic data in the at least one new incident dump file is compared to diagnostic data in at least one corresponding preceding incident dump file. Responsive to the at least one new incident dump file comprising diagnostic data that is different from the at least one corresponding preceding incident dump file, at least one comparison dump file is generated that comprises only the differences in the at least one new incident dump file that are not contained in the at least one corresponding preceding incident dump file. A report package that includes the at least one comparison dump file is then transmitted to a support system. | 07-11-2013 |
| 20130198155 | Identifier Compression for File Synchronization Via Soap Over HTTP - As changes are made to a document, each change may be assigned an extended identifier comprising a globally unique identifier (GUID) component and an integer component. Upon determining that the same GUID component is used in identifiers for multiple changes, the GUID component may be mapped to a range of indices. Each index of the range of indices may then be used to represent the same GUID component in each extended identifier. | 08-01-2013 |
| 20130204853 | Related Data Dependencies - A computer-implemented method for use in maintaining currency of a projection index of a plurality of database objects. The computer-implemented method includes creating the projection index representative of a connection between a first database object and at least a second database object, determining an entity dependency between the first database object and at least the second database object, determining a path dependency between the first database object and at least the second database object, and updating the projection index in response to a modification of one or both of the entity dependency and the path dependency. | 08-08-2013 |
| 20130290283 | SCM-CONSCIOUS TRANSACTIONAL KEY-VALUE STORE - Embodiments of a method are described. In one embodiment, the method is a method for executing and supporting transactions. The method includes receiving a transaction comprising a command and data. The method includes writing the data to a transaction manager on a persistent memory device. The transaction manager also maintains a status of the transaction and reference to entries within memory that are manipulated by the transaction. The method also includes creating an in-memory log of the transaction in a first hash directory. The method includes committing a copy of the first hash directory to a second hash directory maintained on a persistent memory device. | 10-31-2013 |
| 20130297578 | INTEGRATED CIRCUIT DEVICE AND METHOD FOR DETERMINING AN INDEX OF AN EXTREME VALUE WITHIN AN ARRAY OF VALUES - An integrated circuit device comprises at least one digital signal processor, DSP, module, the at least one DSP module comprising a plurality of data registers and at least one data execution unit, DEU, module arranged to execute operations on data stored within the data registers. The at least one DEU module is arranged to, in response to receiving an extreme value index instruction, compare a previous extreme value located within a first data register set of the DSP module with at least one input vector data value located within a second data register set of the DSP module, and determine an extreme value thereof. The at least one DEU module is further arranged to, if the determined extreme value comprises an input vector data value located within the second data register set, store the determined extreme value in the first data register set, determine an index value for the determined extreme value, and store the determined index value in the first data register set. | 11-07-2013 |
| 20140012827 | INDEXING OF DATABASE QUERIES - Making data available from a database is disclosed. Making data available includes specifying a query function having a query function name, wherein the query function includes a structure and a member, determining the structure and the member included in the query function, wherein the query function has a query function name and includes the structure and the member, creating an index for the structure on the member, and compiling the query function to be available to a user by invoking the query function name without the user having to specify the structure and the member. Retrieving data from a database is disclosed. Retrieving includes invoking a query function that specifies a plurality of structures and a value, accessing a cross index of the plurality of structures, and using the cross index to access the data. | 01-09-2014 |
| 20140012828 | MAINTAINING CONSISTENCY IN A DATABASE - Maintaining consistent DNS information is disclosed. Information associated with a resource is received. A resource record is populated with the information. View information is derived from the resource record. | 01-09-2014 |
| 20140025652 | REDISTRIBUTE NATIVE XML INDEX KEY SHIPPING - Techniques are described for data redistribution. Embodiments store a first set of receiver location identifiers mapped to a document identifier and assigned to a first set of receiver locations storing relational data referencing the document identifier. Embodiments store a second set of receiver location identifiers mapped to the document identifier and assigned to a second set of receiver locations storing document data corresponding to the document identifier referenced by the relational data. Sender index keys are received separately from the relational data and the document data, the sender index keys referencing the document identifier and containing sender location identifiers. Embodiments determine, from the first set of receiver location identifiers and the second set of receiver location identifiers, which receiver location identifiers are mapped to the document identifier referenced by the sender index keys. The sender location identifiers are then replaced with the determined receiver location identifiers. | 01-23-2014 |
| 20140032511 | SEARCH DEVICE, A SEARCH METHOD AND A COMPUTER READABLE MEDIUM - Provided is a search device including an acquiring section that acquires extraction target information indicating a feature of data to be extracted; an identification information extracting section that references a plurality of index files, which each associate pieces of feature information indicating features of a plurality of pieces of data with identification information identifying each piece of data, and extracts from the index files the identification information associated with feature information relating to the extraction target information; and a list creating section that determines whether there are identical pieces of identification information among the pieces of identification information extracted by the identification information extracting section, and creates an identification information list that does not include copies of identical pieces of identification information. | 01-30-2014 |
| 20140032512 | Techniques for Data Retention upon Detection of an Event in an Implantable Medical Device - Methods and apparatus for storing data records associated with a medical monitoring event in a data structure. These include initiating loop recording in an implantable medical device upon determination of a neurological event, wherein loop recording comprises storing a data record of a plurality of data records in a data structure, the plurality of data records representing information about determined neurological events. Methods and apparatus can further include determining a priority index for the plurality of data records based on severity levels of the determined neurological events and replacing older data records of the plurality of data records on the data structure with new data records according to the priority index, wherein the new data records selectively replace those data records in the data structure having the lowest associated priority index. | 01-30-2014 |
| 20140046917 | METHOD AND SYSTEM FOR DATA TRANSFER OPTIMIZATION - A data migration system and method for migrating data objects from a source entity to a target entity, wherein the source entity includes infrastructure shared between discrete systems, the system including: a storage device storing an index of the data objects stored on the shared infrastructure and object attributes of the data objects, said index being in a normalized data model independent of native formats of the discrete systems; a selector adapted to select which objects to migrate based on at least one said object attribute; and an optimizer adapted to optimize the migration of data from the shared infrastructure to the target entity. | 02-13-2014 |
| 20140052703 | Gap Detection in a Temporally Unique Index in a Relational Database - Methods for gap detection in a temporally unique index in a relational database. A temporally unique index is provided in a relational database. The index includes a first set of keys, each including one or more non-temporal and two temporal key parts. In response to receiving an insert, update, or delete statement for a changed row, the rows with identical non-temporal key parts to the changed row are identified. The temporal key parts of the identified rows are compared to the temporal key parts of the changed row to determine whether: the changed row is directly adjacent to a temporally earlier row and temporally later row, a gap is detected between the changed row and a temporally earlier row, or a gap is detected between the changed row and a temporally later row. | 02-20-2014 |
| 20140052704 | DETERMINISTIC LOOKUP USING HASHED KEY IN A MULTI-STRIDE COMPRESSED TRIE STRUCTURE - An input lookup key is hashed and the hashed key divided into stride bits into a multi-level Trie structure. A compression function logically combines the stride bits to generate the compressed index bits into the stride tables. The bucket in the last stride table found by the hashed key may have several keys that collide at the same hash value. Discriminant bits are read from the key and select a stored key in the bucket table for verification of its result. Since the hashed key is a compression of the longer input key, more information is contained per bit of the hashed key than in the long key. The multi-stride lookup is performed first on the hashed key, allowing a faster convergence to the lookup result. The first stride can index a single hash table, with the remaining hash bits and discriminant bits used to select from among colliding keys. | 02-20-2014 |
| 20140074810 | MANAGING A SEARCH INDEX - Concepts and technologies are described herein for managing a search index. In accordance with the concepts and technologies disclosed herein, a search index can be hosted by a number of search nodes. The search engine can be configured to determine if a search node is unavailable, and if so, if data stored at the unavailable search node is to be replaced. If data stored at the unavailable search node is to be replaced, the search engine can identify sources for data to be used to replace the data at the unavailable search node. The search engine can issue instructions to the sources and/or the unavailable search node to copy the data from the sources to the unavailable node and/or to replace the data at the unavailable node with the data from the sources. Portions of the data can be copied from each of the sources to the unavailable node. | 03-13-2014 |
| 20140081934 | DYNAMIC UPDATES TO A SEMANTIC DATABASE USING FINE-GRAIN LOCKING - A system for updating an index into a tuple table of tuples is provided. An indexing system updates an index into a tuple table using fine-grain locking of the index. The index includes a values table with an entry for each index value of an index field that references a value-tuple table that includes, for each tuple with the index value, a row that identifies a tuple of the tuple table with that indexed value. After a new tuple is added to the tuple table with a value, the index is updated by locking the entry in the values table, updating the value-tuple table for the value, and then unlocking the entry. When the index is accessed for locating tuples with a value, the accessor locks the entry in the values table for the value, uses the value-tuple table to locate the tuples, and unlocks the entry. | 03-20-2014 |
| 20140089280 | Indexing Quoted Text in Messages in Conversations to Support Advanced Conversation-Based Searching - A method for indexing quoted text includes, obtaining a plurality of index entries in an index. A respective index entry corresponds to a respective term in one or more messages, and has a plurality of index components; a respective index component identifies a message associated with the respective term. The method further includes, responsive to receiving a first message; updating the index by: associating the first message with a conversation having one or more other messages; identifying text in the first message as quoted text based on text that occurs in one or more of the other messages; and updating, in the index, first-message index components that each includes an identifier of the first message, which includes original text index components and quoted text index components. The quoted text index components include information indicating that the corresponding terms are terms in the quoted text of the first message. | 03-27-2014 |
| 20140114940 | METHOD AND SYSTEM FOR SEARCHING STORED DATA - A complete document management system is disclosed. Accordingly, systems and methods for managing data associated with a data storage component coupled to multiple computers over a network are disclosed. Systems and methods for managing data associated with a data storage component coupled to multiple computers over a network are further disclosed. Additionally, systems and methods for accessing documents available through a network, wherein the documents are stored on one or more data storage devices coupled to the network, are disclosed. | 04-24-2014 |
| 20140188826 | SYSTEMS AND METHODS FOR MANAGING FILES IN A COMPUTER SYSTEM BY SEGMENTING FILES - Systems and methods allow for reliably and efficiently managing files stored on a data storage medium associated with a computer system such as a set-top box. In one embodiment a method of managing a file is provided. The method includes: mounting a first file system to a second file system; creating, by the first file system, a virtual file by partitioning a file into a plurality of segments and by linking the plurality of segments in an index file; and sending a file operation request, by the first file system, to the second file system based on the segments of the virtual file. | 07-03-2014 |
| 20140244606 | METHOD, APPARATUS AND SYSTEM FOR STORING, READING THE DIRECTORY INDEX - A method, apparatus and system for storing and reading the directory index and belongs to the field of computer technology is provided. The method includes: configuring all directories in the directory index with identifiers respectively; according to each directory identifier, splitting the directory index so as to obtain the directory split item corresponding to each directory identifier, wherein each directory split item and its corresponding directory identifier are stored as a record item, and each directory split item comprises at least corresponding sub-directory identifier and corresponding file storage address. By the configuration of the disclosure, the granularity of the directory index is refined, and access performance for the directory index is improved. | 08-28-2014 |
| 20140250093 | SYSTEMS AND METHODS FOR MANAGEMENT OF VIRTUALIZATION DATA - Described in detail herein is a method of copying data of one or more virtual machines being hosted by one or more non-virtual machines. The method includes receiving an indication that specifies how to perform a copy of data of one or more virtual machines hosted by one or more virtual machine hosts. The method may include determining whether the one or more virtual machines are managed by a virtual machine manager that manages or facilitates management of the virtual machines. If so, the virtual machine manager is dynamically queried to automatically determine the virtual machines that it manages or that it facilitates management of. If not, a virtual machine host is dynamically queried to automatically determine the virtual machines that it hosts. The data of each virtual machine is then copied according to the specifications of the received indication. | 09-04-2014 |
| 20140258251 | MANAGEMENT OF UPDATES IN A DATABASE SYSTEM - A method, system, and computer program product to efficiently maintain 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 method, system, and computer program product may include receiving a maintenance request related to the index. The method, system, and computer program product may include accounting for the maintenance request when the index is being searched. The method, system, and computer program product may include adding the maintenance request to the log when the index is not being searched. | 09-11-2014 |
| 20140258252 | METHOD AND SYSTEM FOR DYNAMICALLY PARTITIONING VERY LARGE DATABASE INDICES ON WRITE-ONCE TABLES - Methods and systems for partitioning and dynamically merging a database index are described. A database index includes a single first-level index partition stored in a data cache. As the first-level index partition in the data cache reaches a predetermined size, it is copied to secondary storage and a new index partition is generated in the data cache. When the number of index partitions in secondary storage reaches some predetermined number, the index partitions are merged to create a single index partition of a higher level in a hierarchy of index partitions having an exponentially increasing size with each increase in level within the hierarchy. | 09-11-2014 |
| 20140279983 | PROVIDING RECORD-LEVEL ALTERNATE-INDEX UPGRADE LOCKING - In one embodiment, a method includes receiving a request to perform an update on a base data set in a record-oriented file system, locate all alternate index (AIX) records for the base data set, each AIX record including an alternate key field along with one or more relative byte address (RBA) values when the base data set is an entry sequenced data set (ESDS) or one or more primary keys when the base data set is a key sequenced data set (KSDS). Each RBA value/primary key corresponds to one record in the base data set. Individual record-level locks are acquired on each affected AIX record that includes alternate key field values and/or RBA values that are modified by the update. The affected AIX records may be updated after acquiring the individual record-level locks on each of the affected AIX records. Moreover, the affected AIX records may be updated in parallel with updating of unaffected AIX records, thereby greatly increasing performance. | 09-18-2014 |
| 20140304244 | Anonymization Index Determination Device and Method, and Anonymization Process Execution System and Method - An appropriate index value for guaranteeing the anonymity of data is specified, even when the data number of data included in a predetermined group increases and decreases with time. | 10-09-2014 |
| 20140317069 | INDEXING OF SIGNIFICANT MEDIA GRANULARS - Identifying significant media granulars may comprise partitioning a media document into one or more media granulars. A score may be assigned to each of the one or more media granulars. The one or more media granulars may be monitored to detect one or more user actions on the one or more media granular. The score associated with a respective one of the media granulars may be updated based on a number of user actions detected on the respective one of the media granulars. A media granular may be identified as being significant based on the score meeting a threshold. | 10-23-2014 |
| 20140324804 | COMPUTING DEVICES WITH MULT-LAYER FILE SYSTEMS - Technologies are generally described for a multi-layer file system. In the multi-layer file system, a file is arranged into two or more data blocks respectively associated with corresponding multi-entry file indices. Each multi-entry file index can point to a location index at the beginning of a linked list (an initial entry in the linked list). The linked list may have at least one location index as an entry to identify a location in the storage device where the associated data block is stored. | 10-30-2014 |
| 20140344235 | DETERMINATION OF DATA MODIFICATION - To determine a row with modified data, a dataset is retrieved from a data store and displayed on a user interface in rows and columns. A first database index corresponding to the rows is generated and stored in a technical column in the data store. An input is received on the UI to modify the displayed dataset and the modified dataset is stored in the data store. A second database index corresponding to the rows including modified dataset is generated and the associated field of the technical column in the data store is updated with the second database index. The row including the modified dataset is determined based on the second database index stored in the technical column. | 11-20-2014 |
| 20140344236 | Index Update Pipeline - Distributed database management systems may maintain collections of items spanning multiple partitions. Index structures may correspond to items on one partition or to items on multiple partitions. Item collections and indexes may be replicated. Changes to the data maintained by the distributed database management system may result in updates to multiple index structures. The changes may be compiled into an instruction set applicable to the index structures. In-memory buffers may contain the instructions prior to transmission to affected partitions. Replication logs may be combined with an acknowledgment mechanism for reliable transmission of the instructions to the affected partitions. | 11-20-2014 |
| 20140372392 | REDUCING COLLISIONS WITHIN A HASH TABLE - Collisions in hash tables are reduced by removing each empty bucket from a hash table and compacting the non-empty buckets, generating a map of the hash table indicating a status of the buckets of the hash table, and accessing data in the hash table by applying a hash key to the generated map to determine a corresponding bucket containing the data. | 12-18-2014 |
| 20150039575 | MANAGING MULTIPLE LOCKS FOR DATA SET MEMBERS IN A DATA SET INDEX - Provided are a computer program product, system, and method for managing multiple locks for data set members in a data set index. The data set index has leaf nodes and internal nodes. In response to determining that a current lock is set at a locked node that prevents a grant to a requested lock, a determination is made as to whether there are different first and second descendant nodes from the locked node at a same level of the tree data structure linked to the requested data set member and the locked data set member, respectively. If so, the requested lock for the requested data set member is set at the first descendant node, the current lock is moved to the second descendant node for the locked data set member and the requested lock is granted. | 02-05-2015 |
| 20150046416 | Method for writing and reading data - A method for writing and reading data into or out of an indexed dataset includes a data structure and an associated index structure, a processing unit that receives data to be written in plain text and writes the data to the data structure by means of write access and updates index data in the index structure. The processing unit detects data to be read out or the memory location thereof by means of access to the index data and reads out a data from the data structure by means of read access and makes the same available in plain text. The data in the data structure and the index data in the index structure are stored in an encrypted manner. Write/read access of the processing unit to the index structure and to the data structure take place via at least one en- and decryption unit. | 02-12-2015 |
| 20150100557 | Index Building Concurrent with Table Modifications and Supporting Long Values - Disclosed herein are system, method, and computer program product embodiments for constructing an index for a database table. An index that comprises a data structure may be created. The index can then be populated with data from the database table. When a request to modify the database table is received, the method may determine that the request to modify the database table relates to a portion of the database table corresponding to a portion of the index that has yet to be populated. An entry indicating the requested modification can be inserted into the portion of the index that has yet to be populated. | 04-09-2015 |
| 20150127624 | FRAMEWORK FOR REMOVING NON-AUTHORED CONTENT DOCUMENTS FROM AN AUTHORED-CONTENT DATABASE - The specification relates to framework for removing non-authored content documents from an authored-content database by recording a sequence of authorship data for at least one authored-content document over a period of time. The at least one authored-content document can be indexed in an authored-content database. The sequence of authorship data is analyzed to determine if the at least one authored-content document changed in a meaningful way beyond a set threshold. If the at least one authored-content document is changed beyond the set threshold, the at least one authored-content document is removed from the authored-content database. | 05-07-2015 |
| 20150310053 | METHOD OF GENERATING SECONDARY INDEX AND APPARATUS FOR STORINGSECONDARY INDEX - A method and apparatus for generating and storing a secondary index. The method includes generating, in response to a size of an index data being greater than a size of a memory block, an index data table including the index data and recording the index data table in a memory, generating a metadata table of the index data table and recording the metadata table in the memory, and performing a merge and sort regarding at least one of the index data table and the metadata table. The apparatus includes a memory; and a controller configured to, in response to a size of index data being greater than a size of a memory block, generate an index data table including the index data and record the index data table in a memory, and perform a merge and sort regarding at least one of the index data table and the metadata table. | 10-29-2015 |
| 20150317352 | MANAGING A TEMPORAL KEY PROPERTY IN A DATABASE MANAGEMENT SYSTEM - Embodiments provide an approach for efficiently searching a temporal key index as well as enforcing key distinctiveness property in a database table corresponding to the index. For example, by addressing time range overlaps in an index having a sort order for temporal keys, a database management tool of a server system may efficiently process client requests while enforcing a temporal key property in the database table. | 11-05-2015 |
| 20150324382 | OPTIMIZING SINGLE-VALUE DATABASE READ OPERATIONS USING A SINGLE VALUE CACHE - The present disclosure describes methods, systems, and computer program products for optimizing single-value database read operations. One computer-implemented method includes initializing, by a computer, a single value cache associated with a created database table where a column of the database table contains a single or unique data value, verifying that the created database table is in a useable state, performing an operation on the database table, and retrieving the data value from the single value cache without locking the column containing the single or unique data value. | 11-12-2015 |
| 20150331907 | PREFIX BURROWS-WHEELER TRANSFORMATION WITH FAST OPERATIONS ON COMPRESSED DATA - The Prefix Burrows-Wheeler Transform (“PWBT”) is described to provide data operations on data sets even if the data set has been compressed. Techniques to set up a PWBT, including an offset table and a prefix table, and techniques to apply data operations on data sets transformed by PWBT are also described. Data operations include k-Mer substring search. General applications of techniques using PWBT, such as plagiarism searches and open source clearance, are described. Bioinformatics applications of the PWBT, such as genomic analysis and genomic tagging, are also described. | 11-19-2015 |
| 20150347434 | REDUCING METADATA IN A WRITE-ANYWHERE STORAGE SYSTEM - Systems and methods for reducing metadata in a write-anywhere storage system are disclosed herein. The system includes a plurality of clients coupled with a plurality of storage nodes, each storage node having a plurality of primary storage devices coupled thereto. A memory management unit including cache memory is included in the client. The memory management unit serves as a cache for data produced by the clients before the data is stored in the primary storage. The cache includes an extent cache, an extent index, a commit cache and a commit index. The movement of data and metadata is by an interval tree. Methods for reducing data in the interval tree increase data storage and data retrieval performance of the system. | 12-03-2015 |
| 20150347495 | Enhanced B-Trees with Record Merging - In some implementations, a B+tree (b plus tree) can provide concurrent access to data while modifying nodes of the B+tree. In some implementations, a top-down B+tree can be provided where nodes of the B+tree can be proactively merged, rebalanced and split to prevent recursive operations moving up the B+tree. In some implementations, node (or page) record data can be merged to consolidate record entries within nodes of the B+tree while only locking 1-3 nodes of the tree at the same time. In some implementations, record data can be merged across multiple nodes of the B+tree. In some implementations, ranges of data can be removed from the tree while only locking 1-3 nodes of the tree at the same time. In some implementations, range of data can be replaced with new data while only locking 1-3 nodes of the tree at the same time. | 12-03-2015 |
| 20150363447 | MINIMIZING INDEX MAINTENANCE COSTS FOR DATABASE STORAGE REGIONS USING HYBRID ZONE MAPS AND INDICES - Elements of a database object are stored among a plurality of different storage regions, each storage region being associated with a first value range indicating upper and lower range values for element values within that storage region. An index is generated and maintained for one or more second value ranges that include range values that comprise subsets of the first value ranges. A query is processed that includes a query value and one or more storage regions to be read is determined by using one of the index and the first value ranges based on the query value relative to a second value range. | 12-17-2015 |
| 20160070745 | INDEX SUSPENSION PRIOR TO DATABASE UPDATE - Embodiments of the present invention disclose a method, a computer program product, and a computer system for suspending and activating a database index. A computer determines a quantity of changes for a number of rows of a database that are to be made by an update of the database. The computer determines whether to suspend an index of the database based, at least in part, on a comparison between the quantity of changes and a pre-determined threshold value. The computer suspends the index of the database based on a result of the comparison that indicates the quantity of changes at least meet the pre-determined threshold value. A suspension of the index of the database initiates a rebuilding of the index. | 03-10-2016 |
| 20160070746 | AUTOMATED SUSPENSION AND REBUILDING OF DATABASE INDICES - Embodiments of the present invention disclose a method, computer program product, and a computer system for suspending a database index. A computer determines if an update to a database includes an update to an index of the database. If so, the computer suspending the index of the database, wherein the suspending the index of the database comprises: the computer deleting the index of the database; the computer retaining a definition for the index of the database, wherein the definition includes a command for rebuilding the index of the database; and the computer indicating in a system catalog of the database that a status of suspension has been applied to the index. | 03-10-2016 |
| 20160078041 | HOT DEPLOYMENT OF EMBEDDED DATABASE PROCEDURES - Disclosed herein are systems and methods for the hot deployment of database procedures embedded in a host software application. In various example embodiments, the database procedures are encapsulated in specially marked methods of the host application, which, when called at runtime, cause the database procedures, and associated procedure stubs through which the database procedures are called, to be created in a database catalog and executed on the database server. When an embedded database procedure is modified in an application by one user during execution of that application by a second user, compilation of the modified database procedure may result in deletion of the original database procedure and/or associated procedure stub from the database, avoiding inconsistencies between database procedure versions during application execution by the second user. | 03-17-2016 |
| 20160110409 | Large-Scale, Dynamic Graph Storage and Processing System - A method in a graph storage and processing system is provided. The method includes storing, in a scalable, distributed, fault-tolerant, in-memory graph storage device, base graph data representative of graphs, and storing, in a real-time, in memory graph storage device, update graph data representative of graph updates for the graphs with respect to a time threshold. The method further includes sampling the base graph data to generate sampled portions of the graphs and storing the sampled portions, by an in-memory graph sampler. The method additionally includes providing, by a query manager, a query interface between applications and the system. The method also includes forming, by the query manager, graph data representative of a complete graph from at least the base graph data and the update graph data, if any. The method includes processing, by a graph computer, the sampled portions using batch-type computations to generate approximate results for graph-based queries. | 04-21-2016 |
| 20160117354 | METHOD AND SYSTEM FOR DYNAMICALLY PARTITIONING VERY LARGE DATABASE INDICES ON WRITE-ONCE TABLES - Methods and systems for partitioning and dynamically merging a database index are described. A database index includes a single first-level index partition stored in a data cache. As the first-level index partition in the data cache reaches a predetermined size, it is copied to secondary storage and a new index partition is generated in the data cache. When the number of index partitions in secondary storage reaches some predetermined number, the index partitions are merged to create a single index partition of a higher level in a hierarchy of index partitions having an exponentially increasing size with each increase in level within the hierarchy. | 04-28-2016 |
| 20160132542 | ONLINE INDEX REBUILDING METHOD AND APPARATUS - An online index rebuilding method and apparatus are disclosed. The method includes: creating an index snapshot, an index cache, and a target index, and blocking a write transaction to a base table of a database during a creating process; migrating source index data in the source index to the target index page by page according to a sequence of an index page, and filtering out invalid source index data from the source index by using the index snapshot during a migration process; storing new index data; and during the migration process, if new index data required by a current index page, migrating both the new index data and source index data that is in the current index page to the target index; or, after migration of all the source index data is complete, migrating the new index data in the index cache to the target index. | 05-12-2016 |
| 20160147781 | INDEX SUSPENSION PRIOR TO DATABASE UPDATE - Embodiments of the present invention disclose a method, a computer program product, and a computer system for suspending and activating a database index. A computer determines a quantity of changes for a number of rows of a database that are to be made by an update of the database. The computer determines whether to suspend an index of the database based, at least in part, on a comparison between the quantity of changes and a pre-determined threshold value. The computer suspends the index of the database based on a result of the comparison that indicates the quantity of changes at least meet the pre-determined threshold value. A suspension of the index of the database initiates a rebuilding of the index. | 05-26-2016 |
| 20160147808 | INVERTED INDEXING - Disclosed herein are system, method, and computer program product embodiments for inverted indexing. An embodiment operates by receiving a request to add a new document identifier (doc ID) to an inverted index. A memory block corresponding to where the doe ID is to be added is determined or located, and the available space remaining in the memory block is determined. If the memory block has available space, the doc ID is added to the memory block. | 05-26-2016 |
| 20160162535 | RELATIONAL DATA MODEL VARIANT - Systems and methods for handling queries are disclosed. A computer determines that a data-table includes a problematic-key. The problematic-key includes a key used in queries that fails to generate results within a threshold time period. The computer creates a variant-table configured to store at least a portion of the data in the data-table and optimize processing queries using the problematic-key. The computer receives a new query including a key. Upon determining that the query-key is a problematic-key and that resolving the new query using information associated with a latest update time of the variant-table is acceptable, the computer generates a result for the new query using the variant-table. Upon determining that the query-key is a not a problematic-key or that resolving the new query using information associated with a latest update time of the variant-table is unacceptable, the computer generates a result for the new query using the data-table. | 06-09-2016 |
| 20160203168 | UPDATING DISTRIBUTED SHARDS WITHOUT COMPROMISING ON CONSISTENCY | 07-14-2016 |
| 20180025047 | METHOD AND SYSTEM FOR CONCURRENT DATABASE OPERATION | 01-25-2018 |
| 20190146952 | MANAGING DATA IN STORAGE ACCORDING TO A LOG STRUCTURE | 05-16-2019 |
