Abstract: A set of inbound data is received in a computer. At least one attribute of the inbound data is determined. The inbound data is parsed. A set of staging records is generated in the computer that include at least some of the inbound data in one or more fields included in each of the staging records. It is determined that at least some of the staging records are ready for migration to a target environment. The staging records are migrated to the target environment in the computer.

Abstract: In at least some disclosed embodiments, a method includes a) creating a first stub file on a target file server, b) creating a t-stub file at the location of the source directory, c) disabling performance of operations on the source data while allowing completion of operations in progress, d) copying the source data into a hidden directory on the target file server, thus creating target data, e) overwriting the first stub file by renaming the target data, f) enabling performance of operations on the target data, g) performing queued operations on the target data, and h) deleting the source data from the source file server.

Abstract: A device may store a data structure including information identifying a geometric relationship between first and second coordinate values of a first data type. The data structure may also include a first array of a first length that includes the first coordinate value located at a position identifiable by a reference value. The data structure may also include a second array of a second length that includes the second coordinate value located at a position identifiable by the reference value. The data structure may also include a third array of a third length that includes an attribute value of a second data type, located at a position identifiable by the reference value. The device may receive an indication that one of the lengths is to be modified, and may modify the data structure so that the first length, the second length, and the third length are equivalent.

Abstract: A technique for storing binary large objects (BLObs) in a distributed key-value storage system is disclosed. In an embodiment, the storage of BLObs involves dividing the BLObs into smaller “BLOb chunks” and storing the BLOb chunks in storage nodes of the distributed key-value storage system. A BLOb is first associated with a key, referred to as a “BLOb key,” and each subsequent BLOb chunk is associated with a different unique key, referred to as a “BLOb chunk key.” A list of the BLOb chunks keys is maintained and all of the BLOb chunks of the BLOb can be retrieved from the distributed key-value storage system using the BLOb chunks key list.

Abstract: The present invention provides a system and method for handling large transactions by a storage virtualization system. Current storage virtualization systems can only manage a limited number of data objects stored on an associated NAS system because of the cost or hardware constraints of physical main memory. The present invention will enable a storage virtualization system to increase the number of data objects managed by a factor of five or more by using an associated secondary memory store, such as a disk, to store information or metadata about data objects stored on associated NAS systems. The invention also provides a method for moving metadata from the storage virtualization system memory to the secondary store and back, and recovering metadata if corrupted. The invention thereby increases the number of data objects handled by the storage virtualization system with negligible loss of performance as perceived by clients of the storage virtualization system.

Abstract: Described is a reliable and efficient design for a transactional status oracle (“ReTSO”), which supports large-scale storage systems. ReTSO uses a centralized scheme and implements snapshot isolation, a property that guarantees that read operations read a consistent snapshot of the data store. The centralized scheme of ReTSO enables a lock-free commit algorithm that prevents unreleased locks of a failed transaction from blocking other transactions. Each transaction submits the identifiers of modified rows to the ReTSO, the transaction is committed only if none of the modified rows is committed by a concurrent transaction, and a log of the committed transaction is cached. To recover from failures, before a client is notified of a change, the change cached is first persisted into a write-ahead log, such that the memory state can be fully reconstructed by reading from the write-ahead log. Furthermore, ReTSO implements a lazy, auto-garbage collector hash map that reduces the number of memory accesses per request.

Abstract: A system for integrating databases comprises a first virtual table, a second virtual table, a common table, a list, a generating section, and a selecting section. The first virtual table corresponds to a first data. The second virtual table corresponds to a second data. The common table is associated with the first and second virtual tables. The list indicates information about associations between the first and second virtual tables and the common table. The generating section generates two or more access plans from a database query on the common table. The two or more access plans involve at least one of the first and second virtual tables in accordance with the list. The selecting section selects one of the two or more access plans generated by the generating section to be used to execute the database query.

Abstract: A memory allocation message for each primary memory allocation in a primary memory made by a primary processor is received at a hardware memory management module. A representation of each primary memory allocation is allocated within a second memory in response to each memory allocation message. A determination is made, based upon the allocated representations of each primary memory allocation within the second memory, to free a primary memory allocation in the primary memory. A memory free message is sent to the primary processor instructing the primary processor to free the primary memory allocation in the primary memory.

Abstract: A system for and method of providing reusable software service information based on natural language queries. The system and method may include receiving, from a user system, query data in a natural language format that indicates a request for a plurality of reusable software service applications that are configured to perform a particular task, processing the query data to generate search criteria that include query values, and searching, a database, for the plurality of reusable software service applications based on the query values.

Abstract: A computer-implemented method for dynamically selecting a logical location for an index is described. Information relating to a computing device and a location within the computing device is collected. The information is uploaded to a database. The database is queried for stored information relating to at least one computing device and at least one location within the at least one computing device. A performance score is calculated from the stored information. A logical location for the index is selected based on the calculated scores.

Abstract: A method and apparatus for performing an integrated search is provided. An interface is provided that allows users to search and select any data related to a searchable term. Searchable terms may comprise titles of content, actors, and tags. A client device formulates a search request from the user-selected search terms. A service receives the search request from the client device and formulates a query for at least one broadband database and at least one partner broadcast database. The service queries each broadband database with a compatible query that the service creates using information regarding the type of database queries each partner's database requires. The service formats the data received from the searches of the databases into a user interface screen that is presentable by the client device. The screen information instructs the client device on how it should respond to any key presses by the user.

Abstract: One embodiment is a method that backups up objects to a storage device. A number of objects that are concurrently backed up to the storage device is limited.

Abstract: In general, one aspect described can be embodied in a method for determining a classification for a query. The method can include receiving a request to determine whether to assign a classification to a first query, identifying a plurality of search entities that are associated with the first query based upon data associated with each of the plurality of search entities and the first query, and determining whether to assign the classification to the first query based upon classifications for the identified search entities.

Abstract: A facility management system has a facility GIS database configured with electronic map data and facility management GIS data containing data for identifying a location and a form of a facility located along a railway or a road, a facility register database configured to manage a name of a rail or a road, a kilometer post and attribute information in association with one another, and a kilometer post information management section configured to manage coordinate data of the facility on the general map and the kilometer post in association with each other. When searching for attribute information from the facility register database, the kilometer post information management section is referred to obtain kilometer post information by using the coordinate data of the facility and the attribute information of the facility is searched from the facility register database by using the kilometer post information.

Abstract: Techniques for mapping a virtual R-Tree to an extensible-hash based file system for databases are provided. Spatial data is identified within an existing file system, which stores data for a database. Rows of the spatial data are organized into collections; each collection represents a virtual block. The virtual blocks are used to form an R-Tree spatial index that overlays an existing index for the database on the existing file system. Each row within its particular virtual block includes a pointer to its native storage location within the existing file system.

Abstract: In accordance with embodiments, there are provided mechanisms and methods for automatically presenting selectable options in a lookup field. These mechanisms and methods for automatically presenting selectable options in a lookup field can enable more efficient identification of data via a lookup.

Abstract: A digital processing system provided according to an aspect of the present invention processes items received from different data sources, specifically when a second set of items received from a second data source is related to corresponding ones of a first set of items received from a first data source. In one embodiment, each of the items in the first set and the second set is first assigned a corresponding digital value and then sorted according to a sort order of the assigned digital values to form a sorted output. The digital values are assigned such that items in the second set are grouped with related corresponding ones of the first set of items. Thus, items from different sources are merged (and sorted) based on the relation between the items.

Abstract: There is provided a method, a system and a machine readable medium to optimize storage allocation in a database management system. The method comprises receiving a processing step at a step processing module of an access module processor from a dispatcher module. The method further comprises determining whether a fast access storage flag is set in the processing step, the fast access storage flag indicating use of an intermediate file in fast access storage to store one or more redistributed data rows of a table of a database that is distributed across one or more storage devices of the database management system; Yet further the method comprises selectively allocating a free fast access storage data block to the intermediate file from a fast access storage pool based on the determination that the fast access storage flag is set. Lastly, the method comprises writing a redistributed data row from the one or more redistributed data rows to the allocated fast access storage data block.

Abstract: Systems, processing methods and computer programs that rapidly ingest, archive and dynamically query the data to retrieve it from short and long term storage devices are disclosed. Data is partitioned on queryable fields and metadata relating to the partitioned data is stored in a database. This allows for data to be stored in a persistent queryable state, providing query transparency irrespective of the location that the data is actually stored. Software code with differing functionality that shares consistent data structures and methods is used in components of the system to provide flexibility and speed.

Abstract: A configuration information management device includes a storage unit for storing a configuration item and an item relationship. The configuration information management device controls to cause the storage unit or the different configuration information management device to store the item relationship. The configuration information management device also controls to cause the storage unit or the different configuration information management device containing a configuration item connected to the item relationship to store a replica of the item relationship. When a search request including a series of the configuration item and the item relationship is accepted, the configuration information management device decomposes the search request such that the configuration item and the item relationship arranged in series are together treated as a unit of processing, and performs a search process for each unit of processing.