US20120096233A1 - Apparatus and Method for On-Demand In-Memory Database Management Platform - Google Patents
Apparatus and Method for On-Demand In-Memory Database Management Platform Download PDFInfo
- Publication number
- US20120096233A1 US20120096233A1 US13/280,541 US201113280541A US2012096233A1 US 20120096233 A1 US20120096233 A1 US 20120096233A1 US 201113280541 A US201113280541 A US 201113280541A US 2012096233 A1 US2012096233 A1 US 2012096233A1
- Authority
- US
- United States
- Prior art keywords
- database
- memory
- block
- data
- blocks
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Abandoned
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation
- G06F12/0223—User address space allocation, e.g. contiguous or non contiguous base addressing
- G06F12/0292—User address space allocation, e.g. contiguous or non contiguous base addressing using tables or multilevel address translation means
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
A method and apparatus for constructing a memory-based database service platform, in which database can be on-loaded and off-loaded or unloaded as needed, and can reserve schedule and size of memory and other resources, including CPUs, network, backup, mirroring and recovery recourses. With the service platform, multiple different types of databases can be chosen by specifying data storage type and data operation interfaces, such as Relational Database (RDB), Biometric Database (BDB), Time Series Database (TDB), Data Driven Database (DDDB) and File-based Database (FDB) etc. Database types can be chosen either by user directly or by platform automatically or semi-automatically based on data types and data operation characteristics.
Description
- The present application claims the benefit of the filing dates of U.S. Provisional Application Ser. No. 60/742,364 entitled “Apparatus and Method for On-Demand In-Memory Database Management System,” and filed on Dec. 5, 2005
- Other applications that may of relevance to the present application include the following:
- Invariant Memory Page Pool and Implementation Thereof; U.S. Pat. No. 6,912,641, granted on Jun. 28, 2005; Inventors: Tianlong Chen, Yingbin Wang and Yinong Wei.
- Memory-Resident Database Management System and Implementation Thereof; Ser. No. 10/347,678; Filed on Jan. 22, 2003; Attorney Docket Number 0299-0005; Inventors: Tianlong Chen, Jonathan Vu.
- Distributed Memory Computing Environment and Implementation Thereof; application Ser. No. 10/347,677, Filed on Jan. 22, 2003; Attorney Docket Number 0299-0006; Inventors: Tianlong Chen, Jonathan Vu, Yingbin Wang.
- Image Indexing Search and Implementation Thereof; U.S. Provisional Application Ser. No. 60/454,315 filed on Mar. 14, 2003; Inventors: Tianlong Chen, Yi Rui, Yingbin Wang, and Yinong Wei.
- Apparatus and Method for Biometric Database Management System; application Ser. No. 11/064,266 filed on Feb. 22, 2005; Inventors: Yingbin Wang and Tianlong Chen.
- Data-Driven Database Management System, Ser. No. 11/044,698 filed Jan. 27, 2005; Inventor: Tianlong Chen.
- The entirety of each of the aforementioned patent applications is incorporated by reference herein.
- Not applicable.
- The present invention is related to on-demand in-memory database platform architecture and its applicable services and its implementation.
- In-memory database has its own characteristics that disk-based database does not have. A memory-based database is often much faster than a disk-based database in data retrieval and data processing; since memory-based database has all or most of data and data structure in memory and data operation and data storage are at the same level, it has more flexibility in manipulating data and data structures than disk-based database; such flexibility is greatly suitable for creating customer definable databases as disclosed in the Patent Application “Data-Driven Database Management System” filed by Tianlong Chen. Since data is already in the memory, most copying procedures in normal disk-based database are not required any more, removing a great deal of operation overheads.
- Because of the flexibility provided by memory, it is easy to create a variety of different kinds of databases to handle different types of data with their distinguishing data operations. As examples, a biometric database as disclosed in aforementioned Patent Application “Apparatus and Method for Biometric Database Management System ” handles biometric data and biometric identification and verification operations using proprietary or open standard interface such as BioAPI as query interface; a relational database handles structured data in table format using SQL as query language; in a more general sense, a file system (such as Network File System or NFS) is also one kind of “general-sense” database, and a variety of different file systems having different characteristics using different accessing protocols (such as SCSI). A disk-based relational database uses either a proprietary storage system (i.e. a proprietary file system) or a regular file system provided by the Operating System to store data. Therefore whether it is a regular-sense database or a general-sense database, they can all be abstracted as an abstract database comprising data storage and interfaces for data access, manipulation and other data operations.
- Memory is more expensive than hard disk, however it is faster than hard disk and it is more flexible in data manipulation than hard disk; therefore a system with memory-based database is likely to be more expensive than that with a disk-based database. It is not cost-effective to load database all into memory for some business and applications.
- Such positive and negative characteristics make it possible for a new kind of service architecture - - - on-demand database platform in which a database can be loaded into memory platform for fast data processing, and be off-loaded or unloaded when it is done. Many other services can be done due to the characteristics, including multiple different types of databases, and customizable databases into such on-demand service.
- The present invention disclosed and claimed herein is a method and apparatus for constructing a memory-based database service platform, in which database can be on-loaded and off-loaded or unloaded as needed, and can reserve schedule and size of memory and other resources, including CPUs, network, backup, mirroring and recovery recourses.
- In still another aspect of the disclosed embodiment of the service platform, a method and apparatus for constructing an on-demand memory-based database service platform, in which multiple different types of databases can be chosen by specifying data storage type and data operation interfaces, such as Relational Database (RDB), Biometric Database (BDB), Time Series Database (TDB), Data Driven Database (DDDB) and File-based Database (FDB) etc. And database types can be chosen either by user directly or by platform automatically or semi-automatically based on data types and data operation characteristics.
- In still another aspect of the disclosed embodiment of the service platform, a method and apparatus for managing file-based data storage, database-based data storage or other kinds of data storage in a uniform way.
- In still another aspect of the disclosed embodiment of the service platform, a method and apparatus for constructing a memory-based database service platform, in which CPU and memory can be reserved for databases and data operations; different CPUs can be linked to different data manipulation.
- In still another aspect of the disclosed embodiment of the service platform, a method and apparatus to enable users to choose data operations in a distributed way in which data is manipulated in parallel at “local” service nodes and fuse the result at a “master” node by collecting the sub-results from “local” nodes. The “local” nodes and “master” nodes can be in the different physical servers or in the same physical server.
- The present invention disclosed and claimed herein also includes a method for dynamically generating duplicate memory blocks to duplicate query-intensive memory blocks for dividing and redirecting heavy traffic or for other purpose; the duplicated block can be partial or whole block of the source block. After using, such duplicated memory blocks can be dismissed.
- The present invention disclosed and claimed herein also includes a method for registering and tracking information of related “neighbor” blocks of a block for possible faster access to those neighbor blocks. A first block is a neighbor block of a second block if the first block at least contains an address pointer that points to the second block, or if the first block has any (user-defined) “relationship” with the second block. Remote “neighbor” blocks can be pre-fetched (or pre-cached) to a local server for faster access.
- The present invention further discloses and claims herein a block-oriented memory-based database system in which “neighborhood” information is tracked and used for better data pre-fetching, data loading and other data operations; and duplicated blocks are used for load balancing and access traffic redirection.
- The present invention disclosed and claimed herein also includes a method for statically or dynamically configuring destination of a memory block by changing the information of an entry in the Memory Block Server ID Lookup Table or an entry in the Memory Block ID Lookup Table. Through such change, a memory location represented by a DMCE Virtual Address (which was disclosed in the Patent Application of “Distributed Memory Computing Environment and Implementation Thereof” by Tianlong Chen et al.) can be dynamically pointed to one or multiple addresses that are different from the originally pointed address.
- Still other aspects, features, and advantages of the present invention are readily apparent from the following detailed description, simply by illustrating preferable embodiments and implementations. The present invention is also capable of other and different embodiments, and its several details can be modified in various respects, all without departing from the spirit and scope of the present invention. Accordingly, the drawings and descriptions are to be regarded as illustration in nature, and not as restrictive.
- For a more complete understanding of the present invention and the advantages thereof, reference is now made to the following description and the accompanying drawings, in which:
-
FIG. 1 illustrates a conceptual block diagram of an on-demand memory database service platform, in the illustrated sample scenario more than one separated databases are loaded into memory platform as needed. It is configurable that the databases that are loaded into memory can have backup and recovery copies. -
FIG. 2 illustrates a conceptual block diagram of an on-demand memory database service platform, in this illustrated sample scenario two different parts of a database are loaded into memory platform as needed. -
FIG. 3 illustrates a conceptual block diagram of an on-demand memory database service platform. -
FIG. 4 illustrates a set of lookup tables in the memory database service platform for managing and manipulating on-demand loaded databases, including account tracking, resource usage, and database types and configuration information. -
FIG. 5 illustrates a dataflow diagram of loading database or creating a database in the memory database service platform. -
FIG. 6 illustrates a conceptual block diagram of layered database query and management system. -
FIG. 7 illustrates a conceptual block diagram of duplicating memory blocks to off-load hot-spot memory blocks from overloaded query traffic. The duplicated memory blocks are registered and tracked. The query access to the original memory block is then distributed to the duplicated memory blocks. When query traffic is decreased to a preset threshold, the number of duplicated memory blocks can be decreased. -
FIG. 8 illustrates a conceptual block diagram in which memory blocks are tracked with their “neighborhood” information, such neighborhood tracking can be either unidirectional or bidirectional. “Neighborhood” can be due to one block containing address pointers of another block or other user-defined “neighborhood” types. -
FIG. 9 illustrates a conceptual block diagram in which dynamically change of an entry in the Memory Block ID Lookup table and/or the Memory Server ID Lookup Table will effectively change the physical memory location (address) pointed to by a DMCE Virtual Address. Therefore the query to the same DMCE address that follows the entry-change in the Lookup Tables will be changed from that before. - Unless specifically mentioned, a memory can be either volatile or non-volatile.
-
FIG. 1 illustrates a conceptual block diagram of basic on-demand memory database service platform with memory (RAM) 117 managed by “On-demand Database Platform Management” 115. “General-sense”databases memory 117 as memory-based databasefunctional blocks databases backup recovery system 125 which may be another memory-based system or a non-volatile backup system. Reference to the Patent “Invariant Memory Page Pool and Implementation Thereof” for such backup and recovery system. -
FIG. 2 illustrates a conceptual block diagram of another possible operation scenario of the on-demand memory database service platform in which two databasefunctional blocks same database 223 are loaded 203, 207 into memory (RAM) 213 as memory-baseddatabases -
FIG. 3 illustrates a functional block diagram of an on-demand memory database service platform, including four major functional blocks: (1)System Resource Management 301 managing system resources such asmemory 323,CPU 325,network 327, archival (hard disk, storage) 329, and other related resources; (2) Database Administration Management 303 managingdatabase registration 335, database usage andaudit control 337,security 339 anddatabase toolset 341, and other database management functionality; (3) Database Layer Management directly managingdatabases 345, and other general-senseddatabases 347; (4)Administration 307 andUser Interface 309. - Still referring to
FIG. 3 , theSystem Resource Management 301 at least further includes managing resource availability, allocation, reservation, scheduling and automated or user-defined resource actions of memory, CPU, network (port, bandwidth, etc.), archival and etc., and also including virtual memory mapping, memory traffic and network balancing, backup, recovery and mirror functionality. Aninterface layer 331 is provided toAdministration 307 orUser 309 to control or query various resources, anotherinterface layer 321 is provided toAdministration 307 andUser 309 to control or query the backup, recovery and mirror functionality. - Still referring to
FIG. 3 , the Database Administration Management 303 at least further includes 335 database registration, database type selections including general data type, data operation types, data query language that defines the database available operations; including database usage and audit tracking 337 it so desired,database security configuration 339 of who can access what data at what time with what kinds of operations, etc.; includingdatabase toolsets 341 that can be used by user for higher level integrated data manipulation. The Database Administration Management 303 can directly access theresource management functionality 301 through theinterface layer 331, and it also provides an interface 333 forAdministration 307 andUser 309 to access, and aninterface layer 343 to handle and manage thedatabases - Still referring to
FIG. 3 , a User Communication Interface layer 349 is provided forAdministration 307 andUser 309 for access and direct manipulation ofdatabases -
FIG. 4 illustrates an exemplary embodiment in which several Lookup Tables in the Database Administration Management (303 inFIG. 3 )tracking database registration 401, user account information 405, database configuration 403, andresource usage 407. As illustrated in the Database Configuration Lookup Table 403, user can choose built-in or user-defined database types 423 (e.g. standard SQL based relational database, or BioAPI as query language based biometric database as depicted in the Patent Application of “Apparatus and Method for Biometric Database Management System” by Yingbin Wang et al.), storage type 425 (e.g. tree, hash, file-based, block-based, array, etc.; the storage includes the indexation data storage), query interface 427 (such as SQL, direct API, file access protocol, embedded function call, etc.), toolset 429 (e.g. integrated higher level analysis tool package, an example of such package is a Customer Relationship Management(CRM) software package), security setup 431 (e.g. who can access what kinds of data at what time with what kind of actions, role or rule-based security access control, etc.). -
FIG. 5 illustrates an exemplary data flow diagram (which is straightforward and self-explainable to those who are skilled with state of the art) of loading a database into the on-demand service platform or creating a database in the service platform starting fromstep 501, user can start with either querying the availability ofrecourse -
FIG. 6 illustrates a logical functional layer structure from a database point of view in which user access the database (from up to bottom in the diagram) through Database Query andManagement Interface 601, database system includes at leastdata storage structure 603,index storage structure 607 and embedded logic storage structure (or logic functions) 605. An optional I/O Communication layer 609 which provides certain I/O protocol such as SCSI, or Remote DMA to access data or data storage. Amemory management layer 611 provides virtual memory mapping scheme between data storage and actualphysical memory 613 which may spread over one or multiple servers. The I/O communication layer 609 may be part of thememory management layer 611. -
FIG. 7 illustrates a conceptual block diagram of an exemplary memory block replication/duplication working scenario. Memory is used to store data or is used for data manipulation. To off-load the data query traffic especially those heavy data-read traffic, one or multiple duplicate memory blocks 703, 705 can be created to off-load theheavy access traffic 707 to the originalsingle memory block 701, redirecting some of the access traffic fromoriginal memory block 701 to its duplicated memory blocks 703 and 705. The memory blocks 703 and 705 may duplicate partial or whole content ofmemory block 701 depending on user or system setup. Reference to the Patent “Invariant Memory Page Pool and Implementation Thereof” and the Patent “Distributed Memory Computing Environment and Implementation Thereof” for DMCE virtual memory mapping,duplication information 719, 721 can be tracked as an exemplary embodiment in the Memory Block Lookup Table 711. The duplicated memory blocks 703 and 705 may be on different physical servers, in which case the duplication information may be included in Server ID Lookup Table (again reference to the two patents aforementioned in this paragraph). Off-loading scheduling can be Round-Robin (i.e. eachmemory block access traffic 707 decreased or controlled by other user-defined or system-defined rules. When a duplicated memory block is removed, its associated duplication information in the Lookup Table 711 will also be removed. Note, such working scheme can be best used for memory block, but it can also be used for the situation that involves other non-volatile storage block. -
FIG. 8 illustrates a conceptual block diagram of an exemplary memory block neighborhood working scenario. Memory is used to store data or is used for data manipulation. Amemory block memory block 801 if thememory block memory block 801 or the memory blocks are logically adjacent to block 801, or other user or system defined real or virtual reference tomemory block 801. Such neighborhood relationship can be either unidirectional 821 (in which case block 803 is the neighbor ofblock 801, but block 801 is not a neighbor of block 803) or bidirectional 823 (in which case block 801 and 805 are the neighbor of each other). Referring to the Patent “Distributed Memory Computing Environment and Implementation Thereof” for DMCE virtual memory mapping, the neighborhood information may be tracked as an exemplary embodiment in the Memory Block Lookup Table 807 or other similar manor, showingbidirectional neighborhood 817 ofmemory block unidirectional neighborhood 815 ofmemory block 801 to 803. Such neighborhood information provides better logical adjacent information for data pre-fetching, data loading and other data operations. Based on the neighborhood information and required data operation, it may not necessary to load the whole database to memory for data operation such as in the present on-demand memory database service platform, but only load the neighbor blocks for related data access to avoid load unrelated data block into work space (mainly memory) for access which wastes time. Pre-fetching the neighbor blocks can make possibly related data ready (if they are not yet) for access to accelerate data access speed. - Still referring to
FIG. 8 and the Patent “Distributed Memory Computing Environment and Implementation Thereof”, the Patent “Invariant Memory Page Pool and Implementation Thereof”, the neighborhood information makes it easier to build a more flexible block-oriented database management in which database storage is spread among multiple blocks, ideally smaller blocks. In archive mode, database blocks in a database are stored in non-volatile storage environment or other backup or secondary memory or non-memory based storage system (collectively called “secondary system”); in running mode, given a data query and based on neighborhood information, only relevant database blocks (i.e. partial portion of a database) are loaded from storage into memory for data operations. Note such neighborhood working scheme can well be used in non-volatile based database system too. -
FIG. 9 illustrates a DMCE virtual address mapping scheme which has been disclosed in the Patent “Distributed Memory Computing Environment and Implementation Thereof”. Based on the two lookup tables 901 and 905, it is possible to dynamically reconfigure an actual physical location pointed to by a DMCE address 903. By changing the memoryblock starting address 913 of an entry in Memory Block ID Lookup Table 901, the actual physical location pointed by the DMCE address 903 will be changed from a location in a server to another location of the same server. By changing the server information 953 in an entry in the Memory Server ID Lookup Table 905, the actual physical location pointed by the DMCE address 903 will be changed from a location of a server to a similar location in a different server. Therefore, the data access to a physical location is dynamically changed to a different location after the entry change in either or both Lookup tables 901 and 905. In the Memory Block ID Lookup Table 901, it is possible for two or multiple entries to have the same memoryblock starting address 913 and sameother information 915, therefore two or multiple entries actually points to the same physical block. Similarly in Memory Server ID Lookup Table 905, it is possible for two or multiple entries to have the same server information, therefore two or multiple entries actually points to the same server. Such features are extremely useful in the cases of system recovery, mirror and backup such that the query traffic is dynamically and transparently redirected to another blocks or different servers without shutdown data operation. - The foregoing description of the preferred embodiment of the invention has been presented for purposes of illustration and description. It is not intended to be exhaustive or to limit the invention to the precise form disclosed, and modifications and variations are possible in light of the above teachings or may be acquired from practice of the invention. The embodiment was chosen and described in order to explain the principles of the invention and its practical application to enable one skilled in the art to utilize the invention in various embodiments as are suited to the particular use contemplated. It is intended that the scope of the invention be defined by the claims appended hereto, and their equivalents. The entirety of each of the aforementioned documents is incorporated by reference herein.
Claims (10)
1-11. (canceled)
12. A method for implementing a block neighborhood scheme in a memory or non-memory based block storage system storing data, and said block storage system having a plurality of blocks, comprising steps of:
defining a neighborhood relationship criteria among blocks;
remembering neighbor blocks of a first block, and said neighbor blocks satisfying said neighborhood relationship criteria with said first block;
wherein blocks that are used for data access may be stored in a memory or non-memory based backup or secondary system in said block storage system.
13. A method according to claim 12 wherein said neighborhood relationship criteria can be defined when a second block contains a reference to a location in a first block in said block storage system.
14. A method according to claim 12 wherein said neighborhood relationship criteria can be a user-defined rule.
15. A method according to claim 12 wherein said neighborhood relationship criteria can be a logic relationship between blocks.
16. A method according to claim 12 wherein said block neighborhood scheme further comprises steps of pre-fetching a said neighbor block of a said first block when the said first block is or will be accessed to make said neighbor block ready for data access, if said neighbor block is not located to be ready for data access yet.
17. A method according to claim 12 wherein said neighborhood relationship can be unidirectional from a first block to a second block.
18. A method according to claim 12 wherein said neighborhood relationship can be bidirectional if two blocks are neighbors to each other.
19. A method according to claim 12 wherein given a data access query, only relevant blocks, based on said neighborhood relationship information, are loaded into memory for data access.
20-28. (canceled)
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US13/280,541 US20120096233A1 (en) | 2005-12-05 | 2011-10-25 | Apparatus and Method for On-Demand In-Memory Database Management Platform |
Applications Claiming Priority (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US74236405P | 2005-12-05 | 2005-12-05 | |
US11/566,452 US8046557B2 (en) | 2005-12-05 | 2006-12-04 | Apparatus and method for on-demand in-memory database management platform |
US13/280,541 US20120096233A1 (en) | 2005-12-05 | 2011-10-25 | Apparatus and Method for On-Demand In-Memory Database Management Platform |
Related Parent Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US11/566,452 Division US8046557B2 (en) | 2005-12-05 | 2006-12-04 | Apparatus and method for on-demand in-memory database management platform |
Publications (1)
Publication Number | Publication Date |
---|---|
US20120096233A1 true US20120096233A1 (en) | 2012-04-19 |
Family
ID=38175006
Family Applications (4)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US11/566,452 Active 2028-05-02 US8046557B2 (en) | 2005-12-05 | 2006-12-04 | Apparatus and method for on-demand in-memory database management platform |
US13/280,531 Expired - Fee Related US8464013B2 (en) | 2005-12-05 | 2011-10-25 | Apparatus and method for on-demand in-memory database management platform |
US13/280,541 Abandoned US20120096233A1 (en) | 2005-12-05 | 2011-10-25 | Apparatus and Method for On-Demand In-Memory Database Management Platform |
US13/280,553 Active US8386734B2 (en) | 2005-12-05 | 2011-10-25 | Apparatus and method for on-demand in-memory database management platform |
Family Applications Before (2)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US11/566,452 Active 2028-05-02 US8046557B2 (en) | 2005-12-05 | 2006-12-04 | Apparatus and method for on-demand in-memory database management platform |
US13/280,531 Expired - Fee Related US8464013B2 (en) | 2005-12-05 | 2011-10-25 | Apparatus and method for on-demand in-memory database management platform |
Family Applications After (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US13/280,553 Active US8386734B2 (en) | 2005-12-05 | 2011-10-25 | Apparatus and method for on-demand in-memory database management platform |
Country Status (1)
Country | Link |
---|---|
US (4) | US8046557B2 (en) |
Cited By (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN102253897A (en) * | 2011-07-26 | 2011-11-23 | 大唐移动通信设备有限公司 | Method and device for managing memory pool |
US20120284587A1 (en) * | 2008-06-18 | 2012-11-08 | Super Talent Electronics, Inc. | Super-Endurance Solid-State Drive with Endurance Translation Layer (ETL) and Diversion of Temp Files for Reduced Flash Wear |
CN103761248A (en) * | 2013-12-23 | 2014-04-30 | 远光软件股份有限公司 | Method and system for querying data through main memory database |
US20150106557A1 (en) * | 2008-06-18 | 2015-04-16 | Super Talent Technology Corp. | Virtual Memory Device (VMD) Application/Driver for Enhanced Flash Endurance |
US20150106556A1 (en) * | 2008-06-18 | 2015-04-16 | Super Talent Electronics, Inc. | Endurance Translation Layer (ETL) and Diversion of Temp Files for Reduced Flash Wear of a Super-Endurance Solid-State Drive |
Families Citing this family (24)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US8954426B2 (en) * | 2006-02-17 | 2015-02-10 | Google Inc. | Query language |
US20070185870A1 (en) | 2006-01-27 | 2007-08-09 | Hogue Andrew W | Data object visualization using graphs |
US8954412B1 (en) | 2006-09-28 | 2015-02-10 | Google Inc. | Corroborating facts in electronic documents |
US7827138B2 (en) | 2006-10-02 | 2010-11-02 | Salesforce.Com, Inc. | Method and system for synchronizing a server and an on-demand database service |
US8255374B2 (en) | 2006-10-02 | 2012-08-28 | Salesforce.Com, Inc. | Method and system for selecting amongst a plurality of processes to send a message |
US8332435B2 (en) * | 2006-10-03 | 2012-12-11 | Salesforce.Com, Inc. | Method and system for customizing a user interface to an on-demand database service |
CN101399696B (en) | 2007-09-24 | 2011-09-21 | 国际商业机器公司 | Method and system for client software installation through network and corresponding client |
US8725927B2 (en) * | 2008-10-15 | 2014-05-13 | Micron Technology, Inc. | Hot memory block table in a solid state storage device |
BR112013019266A2 (en) * | 2011-01-28 | 2017-07-11 | The Dun And Bradstreet Corp | inventory data access layer |
US20130024484A1 (en) * | 2011-07-22 | 2013-01-24 | International Business Machines Corporation | System management in datacenter using a non-relational database |
US8868611B2 (en) | 2011-07-28 | 2014-10-21 | Hewlett-Packard Development Company, L.P. | Data management system for efficient storage and retrieval of multi-level/multi-dimensional data |
GB2505185A (en) | 2012-08-21 | 2014-02-26 | Ibm | Creating a backup image of a first memory space in a second memory space. |
US11449952B2 (en) * | 2012-10-01 | 2022-09-20 | Oracle International Corporation | Efficiently modeling database scenarios for later use on live data |
US20140108189A1 (en) * | 2012-10-11 | 2014-04-17 | Rolf Schumann | Real-Time Cross-Selling Proposal Calculation |
GB2508659A (en) * | 2012-12-10 | 2014-06-11 | Ibm | Backing up an in-memory database |
US9378228B2 (en) * | 2013-03-08 | 2016-06-28 | Sap Se | Enterprise resource planning running on multiple databases |
US9626231B2 (en) | 2013-05-13 | 2017-04-18 | Sap Se | Database dispatcher |
CN103530413B (en) * | 2013-10-28 | 2017-05-10 | 北京国双科技有限公司 | Method and device for processing data |
US10515326B2 (en) * | 2015-08-28 | 2019-12-24 | Exacttarget, Inc. | Database systems and related queue management methods |
CN106326383B (en) * | 2016-08-16 | 2019-05-24 | 重庆翼耀科技咨询有限公司 | Based on the cascade network platform frame of multiple inlets |
CN107895044B (en) * | 2017-11-30 | 2020-10-30 | 锐捷网络股份有限公司 | Database data processing method, device and system |
CN109298978B (en) * | 2018-11-14 | 2021-07-20 | 武汉烽火信息集成技术有限公司 | Recovery method and system for database cluster of specified position |
EP3769228B1 (en) * | 2019-11-06 | 2022-06-08 | Alipay (Hangzhou) Information Technology Co., Ltd. | Consenus of shared blockchain data storage based on error correction code |
US11860835B1 (en) * | 2020-06-29 | 2024-01-02 | Amazon Technologies, Inc. | Efficient drop column requests in a non-relational data store |
Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6625697B1 (en) * | 1998-11-25 | 2003-09-23 | Siemens Aktiengesellschaft | Cache-storage device with a buffer storing prefetch data |
US6701420B1 (en) * | 1999-02-01 | 2004-03-02 | Hewlett-Packard Company | Memory management system and method for allocating and reusing memory |
US20070094452A1 (en) * | 2005-10-21 | 2007-04-26 | Fachan Neal T | Systems and methods for using excitement values to predict future access to resources |
Family Cites Families (19)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP3453757B2 (en) * | 1989-05-29 | 2003-10-06 | 株式会社日立製作所 | Buffer management method |
US5426747A (en) * | 1991-03-22 | 1995-06-20 | Object Design, Inc. | Method and apparatus for virtual memory mapping and transaction management in an object-oriented database system |
US5765181A (en) * | 1993-12-10 | 1998-06-09 | Cray Research, Inc. | System and method of addressing distributed memory within a massively parallel processing system |
KR100204027B1 (en) * | 1996-02-16 | 1999-06-15 | 정선종 | Database recovery apparatus and method using nonvolatile memory |
US5809495A (en) * | 1996-06-04 | 1998-09-15 | Oracle Corporation | Method for obtaining information regarding the current activity of a database management system from a viritual table in a memory of the database management system |
US5914727A (en) * | 1997-09-09 | 1999-06-22 | Compaq Computer Corp. | Valid flag for disabling allocation of accelerated graphics port memory space |
US6105024A (en) * | 1998-02-12 | 2000-08-15 | Microsoft Corporation | System for memory management during run formation for external sorting in database system |
US6766424B1 (en) * | 1999-02-09 | 2004-07-20 | Hewlett-Packard Development Company, L.P. | Computer architecture with dynamic sub-page placement |
US6304867B1 (en) * | 1999-02-25 | 2001-10-16 | Electronic Data Systems Corporation | System and method for enhanced performance of a relational database management system through the use of application-specific memory-resident data |
US6779095B2 (en) | 2000-06-19 | 2004-08-17 | Storage Technology Corporation | Apparatus and method for instant copy of data using pointers to new and original data in a data location |
US20020161846A1 (en) * | 2001-01-29 | 2002-10-31 | Ulrich Thomas R. | Data path controller architecture |
US6785674B2 (en) * | 2003-01-17 | 2004-08-31 | Intelitrac, Inc. | System and method for structuring data in a computer system |
US7043623B2 (en) * | 2003-01-22 | 2006-05-09 | Intelitrac, Inc. | Distributed memory computing environment and implementation thereof |
US7184577B2 (en) * | 2003-03-14 | 2007-02-27 | Intelitrac, Inc. | Image indexing search system and method |
US7187787B2 (en) * | 2003-03-14 | 2007-03-06 | Intelitrac, Inc. | Method and apparatus for facial identification enhancement |
US6912641B2 (en) * | 2003-04-30 | 2005-06-28 | Intelitrac, Inc. | Invariant memory page pool and implementation thereof |
JP4047908B2 (en) * | 2004-01-19 | 2008-02-13 | トレック・2000・インターナショナル・リミテッド | Portable data storage device using memory address mapping table |
US20050187984A1 (en) | 2004-02-20 | 2005-08-25 | Tianlong Chen | Data driven database management system and method |
US7552319B2 (en) * | 2004-06-30 | 2009-06-23 | Intel Corporation | Methods and apparatus to manage memory access |
-
2006
- 2006-12-04 US US11/566,452 patent/US8046557B2/en active Active
-
2011
- 2011-10-25 US US13/280,531 patent/US8464013B2/en not_active Expired - Fee Related
- 2011-10-25 US US13/280,541 patent/US20120096233A1/en not_active Abandoned
- 2011-10-25 US US13/280,553 patent/US8386734B2/en active Active
Patent Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6625697B1 (en) * | 1998-11-25 | 2003-09-23 | Siemens Aktiengesellschaft | Cache-storage device with a buffer storing prefetch data |
US6701420B1 (en) * | 1999-02-01 | 2004-03-02 | Hewlett-Packard Company | Memory management system and method for allocating and reusing memory |
US20070094452A1 (en) * | 2005-10-21 | 2007-04-26 | Fachan Neal T | Systems and methods for using excitement values to predict future access to resources |
Cited By (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20120284587A1 (en) * | 2008-06-18 | 2012-11-08 | Super Talent Electronics, Inc. | Super-Endurance Solid-State Drive with Endurance Translation Layer (ETL) and Diversion of Temp Files for Reduced Flash Wear |
US8959280B2 (en) * | 2008-06-18 | 2015-02-17 | Super Talent Technology, Corp. | Super-endurance solid-state drive with endurance translation layer (ETL) and diversion of temp files for reduced flash wear |
US20150106557A1 (en) * | 2008-06-18 | 2015-04-16 | Super Talent Technology Corp. | Virtual Memory Device (VMD) Application/Driver for Enhanced Flash Endurance |
US20150106556A1 (en) * | 2008-06-18 | 2015-04-16 | Super Talent Electronics, Inc. | Endurance Translation Layer (ETL) and Diversion of Temp Files for Reduced Flash Wear of a Super-Endurance Solid-State Drive |
US9547589B2 (en) * | 2008-06-18 | 2017-01-17 | Super Talent Technology, Corp. | Endurance translation layer (ETL) and diversion of temp files for reduced flash wear of a super-endurance solid-state drive |
US9548108B2 (en) * | 2008-06-18 | 2017-01-17 | Super Talent Technology, Corp. | Virtual memory device (VMD) application/driver for enhanced flash endurance |
CN102253897A (en) * | 2011-07-26 | 2011-11-23 | 大唐移动通信设备有限公司 | Method and device for managing memory pool |
CN103761248A (en) * | 2013-12-23 | 2014-04-30 | 远光软件股份有限公司 | Method and system for querying data through main memory database |
Also Published As
Publication number | Publication date |
---|---|
US8386734B2 (en) | 2013-02-26 |
US20120095963A1 (en) | 2012-04-19 |
US8046557B2 (en) | 2011-10-25 |
US8464013B2 (en) | 2013-06-11 |
US20070143353A1 (en) | 2007-06-21 |
US20120095959A1 (en) | 2012-04-19 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US8464013B2 (en) | Apparatus and method for on-demand in-memory database management platform | |
US11386044B2 (en) | Tiered storage in a distributed file system | |
US10761758B2 (en) | Data aware deduplication object storage (DADOS) | |
US10496319B2 (en) | Lifecycle management for data in non-volatile memory including blocking creation of a database savepoint and associating non-volatile memory block identifiers with database column fragments | |
US7805470B2 (en) | Methods and apparatus for managing the storage of content in a file system | |
US7827146B1 (en) | Storage system | |
US8543596B1 (en) | Assigning blocks of a file of a distributed file system to processing units of a parallel database management system | |
US7765191B2 (en) | Methods and apparatus for managing the replication of content | |
US7392235B2 (en) | Methods and apparatus for retrieval of content units in a time-based directory structure | |
US20190370225A1 (en) | Tiered storage in a distributed file system | |
US7376681B1 (en) | Methods and apparatus for accessing information in a hierarchical file system | |
CN106687910A (en) | Optimized segment cleaning technique | |
CN108140040A (en) | The selective data compression of database in memory | |
US20060294163A1 (en) | Methods and apparatus for accessing content stored in a file system | |
US7366836B1 (en) | Software system for providing storage system functionality | |
US8180838B2 (en) | Efficiently managing modular data storage systems | |
US20060294115A1 (en) | Methods and apparatus for storing content in a file system | |
US11249968B2 (en) | Large object containers with size criteria for storing mid-sized large objects | |
US20140223100A1 (en) | Range based collection cache | |
KR20130053152A (en) | Method of file management based on tag and system of the same | |
US20070233972A1 (en) | Methods and apparatus for transferring content to multiple destinations | |
US20100228787A1 (en) | Online data volume deletion | |
US20060235893A1 (en) | Methods and apparatus for managing the storage of content | |
US7979665B1 (en) | Method and apparatus for processing access requests in a computer system | |
US8843708B2 (en) | Control block linkage for database converter handling |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AS | Assignment |
Owner name: INTELITRAC, INC., TEXAS Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:CHEN, TIANLONG;REEL/FRAME:027853/0609 Effective date: 20120229 |
|
STCB | Information on status: application discontinuation |
Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION |