摘要:
In one embodiment, an operating system on a computer device interfaces with a graph database that has data nodes interconnected by relationship edges. The operating system generates database instructions that specify a database operation for a target node in the graph database and a node traversal list through the graph database to reach the target node. By then transmitting the database instruction to the graph database, the graph database (e.g., a database management operating system) traverses the specified node traversal list through the graph database to the target node, and performs the database operation on the target node.
摘要:
A method and device are disclosed for an associative and approximate, analog or digital scanning of databases that allows for the asynchronous accessing of data from a mass storage medium. The invention includes providing dedicated analog and digital circuitry and decision logic at the mass storage medium level for determining a key identifying the data of interest, continuously comparing the key to a signal generated from a reading of the data from the mass storage medium with an approximate or exact matching circuit to determine a pattern match, determining a correlation value between the key and the data as it is read in a continuous fashion, and determining a match based upon a preselected threshold value for the correlation value. The pattern matching technique eliminates any need to compare data based on its intrinsic structure or value, and instead is based on an analog or digital pattern. The key and data may be either analog or digital. This device and method may be provided as part of a stand-alone computer system, embodied in a network attached storage device, or can otherwise be provided as part of a computer LAN or WAN.
摘要:
In a first aspect, a method is provided that includes the steps of (1) pre-computing a query result for each of a plurality of whole segments of data included in a database; (2) receiving a query specifying a defined range of data in the database; (3) determining if any of the whole segments are within the defined range; (4) performing the query on any partial segments of data within the defined range; and (5) determining the result of the query based on the pre-computed query results for any whole segments determined to be within the defined range and the result of the query on any partial segments within the defined range. Numerous other aspects are provided.
摘要:
Method, apparatus, and computer program product for reducing the number of operations performed by a persistence manager against a persistent store of data items. A plurality of requests from an application are received. Each request is mapped into a transaction for performance against the persistent store, each transaction having at least one operation. Transactions are accumulated and preprocessed to reduce the number of operations for performance against the persistent store.
摘要:
The present invention provides a system and/or method for reducing disk space usage and/or improving I/O performance of a computer system through the use of data compression and mapping of data page blocks to reduced size data file blocks. The system and/or method can be used to intercept activity at an interface of a computer system I/O subsystem and then map logical data page blocks to reduced sized physical file data blocks on a one-to-one basis, utilizing a suitable data compression algorithm. The system and/or method also allows data compression to be reversed when reading data from a physical disk storage medium associated with that computer system. The system may be implemented as either a device driver or a module linked to an I/O module of a computer system.
摘要:
A method and article of manufacture for managing uniquely indexed segments (304) within a table (302) on a computer system. A segment incarnation number (308) indicates the current status of the segment and the number of times the segment (304) has been added to the table (302). A nextincarnation number (310) indicates the next value to be assigned to the incarnation number if the segment is again added to the table (302). The segments (304) can be accessed or deleted by the provision of a segment index (314) and an accurate incarnation value (308). Any segment with a zero-value incarnation number can be added to the table. The table (302) is stored on a data storage device connected to a computer.
摘要:
Provided are a method, system, and program for accessing data in a database table. A fetch request is received to fetch data from a base table that satisfies a query predicate, wherein rows of the base table are stored in table partitions and wherein there is one index partition for each determined table partition, wherein each index partition includes nodes, wherein each node in each index partition includes at least one key column value from a corresponding table row in the table partition associated with the index partition and a location identifier identifying the corresponding table row in the corresponding table partition. A determination is made of a set of nodes, one from each index partition, whose key column value satisfies the query predicate. One node from the set is selected and data is returned from the table row identified by the location identifier in the selected node in response to the fetch request.
摘要:
Systems, methods, and computer-readable media for determining column ordering of a data storage table for search optimization are described herein. In some examples, a computing system is configured to receive input containing statistics of a plurality of queries. The computing system can then determine a new column order (i.e., layout) based at least in part on the statistics. In some example techniques described herein, the computing system can determine the new column order based at least in part on the hardware components storing the data storage table, storage system parameters, and/or user preference information. Example techniques described herein can apply the new column order to data subsequently added to the data storage table. Example techniques described herein can apply the new column order to existing data in the data storage table.
摘要:
Embodiments of the present disclosure provide a data query method and apparatus, which implement a technical effect that data meeting a precision requirement is queried according to a user's requirement of for data precision. The method includes: receiving a query instruction that includes a query condition and query precision; determining a data partition that meets the query condition; determining a data sub-partition corresponding to the query precision from the data partition; and querying data in the data sub-partition to obtain a query result.
摘要:
A system, method, and computer-readable medium for allocation of a Locality-sensitive Non-Unique Secondary Index are provided. The Locality-sensitive Non-Unique Secondary Index preserves the similarity of incorporated fields as well as improves the average secondary index sub-table look-up performance and is advantageously resilient to the type of predicates and workloads applied thereto. Rows of the secondary index having values of the columns that are hashed to determine a secondary index sub-table row location have a higher probability of being closely located within the secondary index than rows with more dissimilar column values that are hashed to determine the secondary index row location.