Abstract:
Avoiding duplicative storage of managed content is disclosed. It is determined whether content associated with an object has been stored previously in an associated one of a plurality of storage locations used to store managed content with which the object is associated. If it is determined that the content has been stored previously in the storage location, the previously-stored content is associated with the object and the object, but not a duplicate copy of the content, is stored in the storage location.
Abstract:
A method and system for performing a scan operation on a table of a column-oriented database is described. One embodiment receives a database query that references a particular column in a table, the particular column being horizontally partitioned into at least one extent, the at least one extent including at least one data block; consults, for each extent in the particular column for which associated metadata is available, the metadata associated with that extent to determine whether that extent is required to process the scan operation; acquires, for each extent in the particular column for which associated metadata is not available, metadata associated with that extent and uses the acquired metadata associated with that extent to determine whether that extent is required to process the scan operation; and performs the scan operation on only those extents in the particular column determined to be required to process the scan operation.
Abstract:
The same data is stored in at least two different database management systems (DBMS's), including a columnar DBMS (320.2) and a non-columnar (e.g. row-oriented) DBMS (320.1). The columnar DBMS may provide fast responses to queries involving aggregation, and such queries can be routed to the columnar DBMS. A query may be routed to the non-columnar DBMS if for example the query execution involves only small DBMS tables on the non-columnar DBMS. In some situations, an execution time estimate can be obtained from each DBMS, and the query is routed to the DBMS providing the shortest estimate.
Abstract:
The present invention provides a system (10) and/or method (100,200,300) for reducing disk space usage and/or improving I/O performance of a computer system (12) through the use of data compression and mapping of data page blocks (22) to reduced size data file blocks (24). The system (10) and/or method (100,200,300) can be used to intercept I/O activity at an interface of a computer system (12) I/O subsystem and then map logical data page blocks (22) to reduced sized physical file data blocks (24) on a one-to-one basis, utilising a suitable data compression algorithm. The system (10) and/or method (100,200,300) also allows data compression to be reversed when reading data from a physical disk storage medium (18) associated with that computer system (12). The system (10) may be implemented as either a device driver (14b) or a module (14a) linked to an I/O module of a computer system (12).
Abstract:
Systems, methods and user interfaces that allow rapid storage and retrieval of trading data are provided. Trading data records are arranged as a non-indexed collection of data records. The physical location of trading data records stored in a computer-readable medium corresponds to the order that queries are performed. Queries may be performed by analyzing attributes of all of the trading data records, without speed limitations associated with indexed databases.
Abstract:
Systems, methods and user interfaces that allow rapid storage and retrieval of trading data are provided. Trading data records are arranged as a non-indexed collection of data records. The physical location of trading data records stored in a computer-readable medium corresponds to the order that queries are performed. Queries may be performed by analyzing attributes of all of the trading data records, without speed limitations associated with indexed databases.
Abstract:
Avoiding duplicative storage of managed content is disclosed. It is determined whether content associated with an object has been stored previously in an associated one of a plurality of storage locations used to store managed content with which the object is associated. If it is determined that the content has been stored previously in the storage location, the previously-stored content is associated with the object and the object, but not a duplicate copy of the content, is stored in the storage location.
Abstract:
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.
Abstract:
In accordance with an embodiment, the system enables access to a sharded database. A shard-aware client application connecting to a sharded database can use a connection pool (e.g., a Universal Connection Pool, UCP), to store or access connections to different shards or chunks of the sharded database within a shared pool. As new connections are created, a shard topology layer can be built at the database driver layer, which learns and caches shard key ranges to locations of shards, and enables subsequent connection requests from a client application to use a fast key path access to the appropriate shard or chunk. A connection pool and database driver can be configured to allow a client application to provide a shard key, either during connection checkout or at a later time; recognize shard keys specified by the client application; and enable connection by the client application to a particular shard or chunk.