Computer data distribution architecture

• US 10,452,649 B2
• Filed: 05/14/2016
• Issued: 10/22/2019
• Est. Priority Date: 05/14/2015
• Status: Active Grant

• Current Assignee: Deephaven Data Labs, LLC
• Original Assignee: Deephaven Data Labs, LLC
• Inventors: Kent, IV, David R., Caudy, Ryan, Wright, Charles, Teodorescu, Radu
• Primary Examiner(s): Lin, Shew Fen
• Application Number:
  US15/154,996
• Publication Number:
  US 20160335317A1
• Time in Patent Office: 1,256 Days
• CPC Class Codes: G06F 11/1451 by selection of backup contents
• CPC Class Codes: G06F 11/1464 for networked environments
• CPC Class Codes: G06F 11/1469 Backup restoration techniques
• CPC Class Codes: G06F 12/0261 using reference counting
• CPC Class Codes: G06F 12/084 with a shared cache
• CPC Class Codes: G06F 12/1483 using an access-table, e.g. matrix or list
• CPC Class Codes: G06F 15/17331 Distributed shared memory [DSM], e.g. remote direct memory access [RDMA]
• CPC Class Codes: G06F 16/113 Details of archiving lifecycle management in storage systems G06F3/0649; backup systems G06F11/1446
• CPC Class Codes: G06F 16/144 Query formulation
• CPC Class Codes: G06F 16/162 Delete operations erasing in storage systems G06F3/0652
• CPC Class Codes: G06F 16/215 Improving data quality; Data cleansing, e.g. de-duplication, removing invalid entries or correcting typographical errors
• CPC Class Codes: G06F 16/22 Indexing; Data structures therefor; Storage structures
• CPC Class Codes: G06F 16/221 Column-oriented storage; Management thereof
• CPC Class Codes: G06F 16/2228 Indexing structures
• CPC Class Codes: G06F 16/2237 Vectors, bitmaps or matrices
• CPC Class Codes: G06F 16/2246 Trees, e.g. B+trees
• CPC Class Codes: G06F 16/2255 Hash tables
• CPC Class Codes: G06F 16/2264 Multidimensional index structures
• CPC Class Codes: G06F 16/2272 Management thereof
• CPC Class Codes: G06F 16/2282 Tablespace storage structures; Management thereof
• CPC Class Codes: G06F 16/2291 : User-Defined Types; Storage management thereof
• CPC Class Codes: G06F 16/23 : Updating
• CPC Class Codes: G06F 16/2308 : Concurrency control transaction processing G06F9/466
• CPC Class Codes: G06F 16/2358 : Change logging, detection, and notification replication G06F16/27
• CPC Class Codes: G06F 16/2365 : Ensuring data consistency and integrity
• CPC Class Codes: G06F 16/2372 : Updates performed during offline database operations
• CPC Class Codes: G06F 16/2379 : Updates performed during online database operations; commit processing
• CPC Class Codes: G06F 16/242 : Query formulation
• CPC Class Codes: G06F 16/2428 : Query predicate definition using graphical user interfaces, including menus and forms G06F16/2423 takes precedence
• CPC Class Codes: G06F 16/245 : Query processing
• CPC Class Codes: G06F 16/2453 : Query optimisation
• CPC Class Codes: G06F 16/24534 : Query rewriting; Transformation
• CPC Class Codes: G06F 16/24535 : of sub-queries or views
• CPC Class Codes: G06F 16/24537 : of operators
• CPC Class Codes: G06F 16/24539 : using cached or materialised query results
• CPC Class Codes: G06F 16/2455 : Query execution
• CPC Class Codes: G06F 16/24553 : of query operations
• CPC Class Codes: G06F 16/2456 : Join operations
• CPC Class Codes: G06F 16/24561 : Intermediate data storage techniques for performance improvement
• CPC Class Codes: G06F 16/2457 : with adaptation to user needs
• CPC Class Codes: G06F 16/24575 : using context
• CPC Class Codes: G06F 16/248 : Presentation of query results
• CPC Class Codes: G06F 16/254 : Extract, transform and load [ETL] procedures, e.g. ETL data flows in data warehouses
• CPC Class Codes: G06F 16/27 : Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
• CPC Class Codes: G06F 16/278 : Data partitioning, e.g. horizontal or vertical partitioning
• CPC Class Codes: G06F 16/285 : Clustering or classification
• CPC Class Codes: G06F 16/9024 : Graphs; Linked lists G06F16/9027 takes precedence
• CPC Class Codes: G06F 16/907 : Retrieval characterised by using metadata, e.g. metadata not derived from the content or metadata generated manually
• CPC Class Codes: G06F 16/951 : Indexing; Web crawling techniques
• CPC Class Codes: G06F 16/9535 : Search customisation based on user profiles and personalisation
• CPC Class Codes: G06F 16/9538 : Presentation of query results
• CPC Class Codes: G06F 16/9566 : URL specific, e.g. using aliases, detecting broken or misspelled links
• CPC Class Codes: G06F 16/9574 : of access to content, e.g. by caching
• CPC Class Codes: G06F 17/40 : Data acquisition and logging for input to computer G06F3/00
• CPC Class Codes: G06F 21/00 : Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
• CPC Class Codes: G06F 21/6209 : to a single file or object, e.g. in a secure envelope, encrypted and accessed using a key, or with access control rules appended to the object itself
• CPC Class Codes: G06F 2201/805 : Real-time
• CPC Class Codes: G06F 2201/84 : Using snapshots, i.e. a logical point-in-time copy of the data
• CPC Class Codes: G06F 2212/1052 : Security improvement
• CPC Class Codes: G06F 2212/154 : Networked environment
• CPC Class Codes: G06F 2212/163 : Server or database system
• CPC Class Codes: G06F 2212/60 : Details of cache memory
• CPC Class Codes: G06F 3/0481 : based on specific properties of the displayed interaction object or a metaphor-based environment, e.g. interaction with desktop elements like windows or icons, or assisted by a cursor's changing behaviour or appearance
• CPC Class Codes: G06F 3/0482 : Interaction with lists of selectable items, e.g. menus
• CPC Class Codes: G06F 3/0483 : Interaction with page-structured environments, e.g. book metaphor
• CPC Class Codes: G06F 3/04847 : Interaction techniques to control parameter settings, e.g. interaction with sliders or dials
• CPC Class Codes: G06F 3/0485 : Scrolling or panning
• CPC Class Codes: G06F 3/04895 : Guidance during keyboard input operation, e.g. prompting
• CPC Class Codes: G06F 3/0605 : by facilitating the interaction with a user or administrator
• CPC Class Codes: G06F 3/0656 : Data buffering arrangements
• CPC Class Codes: G06F 3/067 : Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]
• CPC Class Codes: G06F 40/117 : Tagging; Marking up details of markup languages G06F40/143; Designating a block; Setting of attributes style sheets, e.g. eXtensible Stylesheet Language Transformation [XSLT], G06F40/154
• CPC Class Codes: G06F 40/134 : Hyperlinking
• CPC Class Codes: G06F 40/166 : Editing, e.g. inserting or deleting
• CPC Class Codes: G06F 40/174 : Form filling; Merging
• CPC Class Codes: G06F 40/177 : of tables; using ruled lines
• CPC Class Codes: G06F 40/18 : of spreadsheets form-filling G06F40/174
• CPC Class Codes: G06F 40/183 : Tabulation, i.e. one-dimensional positioning
• CPC Class Codes: G06F 40/216 : using statistical methods
• CPC Class Codes: G06F 40/274 : Converting codes to words; Guess-ahead of partial word inputs
• CPC Class Codes: G06F 8/30 : Creation or generation of source code
• CPC Class Codes: G06F 8/41 : Compilation
• CPC Class Codes: G06F 8/427 : Parsing
• CPC Class Codes: G06F 8/60 : Software deployment
• CPC Class Codes: G06Q 40/04 : Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
• CPC Class Codes: H04L 12/18 : for broadcast or conference , e.g. multicast
• CPC Class Codes: H04L 51/046 : Interoperability with other network applications or services
• CPC Class Codes: H04L 51/212 : using filtering or selective blocking
• CPC Class Codes: H04L 61/5069 : for group communication, multicast communication or broadcast communication
• CPC Class Codes: H04L 63/101 : Access control lists [ACL]
• CPC Class Codes: H04L 63/102 : Entity profiles
• CPC Class Codes: H04L 67/01 : Protocols
• CPC Class Codes: H04L 67/1001 : for accessing one among a plurality of replicated servers
• CPC Class Codes: H04L 67/141 : Setup of application sessions admission control or resource allocation in data switching networks H04L47/70
• CPC Class Codes: H04L 67/34 : involving the movement of software or configuration parameters network booting or remote initial program loading [RIPL] G06F9/4416
• CPC Class Codes: H04L 67/56 : Provisioning of proxy services store-and-forward switching systems in data switching networks H04L12/54
• CPC Class Codes: H04L 67/566 : Grouping or aggregating service requests, e.g. for unified processing
• CPC Class Codes: H04L 67/568 : Storing data temporarily at an intermediate stage, e.g. caching
• CPC Class Codes: H04L 67/5681 : Pre-fetching or pre-delivering data based on network characteristics
• CPC Class Codes: H04L 69/16 : Implementation or adaptation of Internet protocol [IP], of transmission control protocol [TCP] or of user datagram protocol [UDP]

Abstract

Described are methods, systems and computer readable media for computer data distribution architecture.

Claims

1. A computer database system with a plurality of memory devices optimized for ordered data and read-dominated workloads, the system comprising:

one or more processors;

computer readable storage coupled to the one or more processors, the computer readable storage having stored thereon instructions that, when executed by the one or more processors, cause the one or more processors to perform operations including;

storing at a first data server computer first data in a first memory device in a first column-oriented configuration;

storing at a second data server computer second data in a second memory device in a second column-oriented configuration;

storing at a third data server computer the third data in a third memory device in a third column-oriented configuration;

executing, at a query server computer, a database query, the query server computer comprising a query server memory device and being coupled to the first, second, and third data server computers, the executing comprising;

providing a table data cache proxy operable to optimize performance of computer data access to the first, second, and third data server computers by;

requesting a latest table state from two or more of the first, second, and third data server computers;

filtering the latest table state to generate a complete, non-duplicative composite table state that includes one of data or metadata from the two or more of the first, second, and third data server computers, wherein the non-duplicative composite table state includes table locations, and wherein the table data cache proxy is operable to filter table locations to be distributed to one or more remote query processors to interleave table locations from the first, second, and third data server computers and distribute subsequent data access across the first, second, and third data server computers; and

providing, from the table data cache proxy a single, non-composite service for table location;

accessing a table comprising first and second columns, one or more first rows, and one or more second rows, wherein a given location for the table is provided by the single, non-composite service;

storing one or more first location identifiers indicating where column data of the first column is stored and one or more second location identifiers indicating where column data of the second column is stored,

the one or more first location identifiers indicating that data of the one or more first rows of the first column is stored in the first memory device of the first data server computer,

the one or more second location identifiers indicating that data of the one or more first rows of the second column is stored in the second memory device of the second data server computer and that data of the one or more second rows of the second column is stored in the third memory device of the third data server computer; and

storing a table index comprising, for each location identifier of the one or more first location identifiers and the one or more second location identifiers, an index identifier indicating a valid portion of the data at the location indicated by the location identifier, wherein the valid portion of the data includes data corresponding to the rows of the table and excludes data not corresponding to the rows of the table, such that data corresponding to a combination of the first or second location identifiers and the index identifier comprises the table,

wherein the first memory device, the second memory device, and the third memory device are all different from each other, and

wherein the first memory device includes shared memory and the second memory device is faster than the third memory device.

2. The system of claim 1, wherein the executing further comprises:

requesting one or more blocks of data of the first column from the first data server; and

requesting one or more blocks of data of the second column from the second or third data server computers.

3. The system of claim 1, wherein the executing further comprises:

requesting one or more blocks of data of the second column from the second data server computer; and

requesting one or more blocks of data of the second column from the third data server computers.

4. The system of claim 1, wherein the executing further comprises:

requesting one or more blocks of data of the one or more first rows from the first or second data server computers; and

requesting one or more blocks of data of the one or more second rows from the third data server computer.

5. The system of claim 1, wherein the executing further comprises:

requesting one or more blocks of data of the one or more first rows from the first data server computer; and

requesting one or more blocks of data of the one or more first rows from the second data server computer.

6. The system of claim 1, wherein the first memory device is a transitory memory device and the second memory device is a persistent memory device.

7. The system of claim 1, wherein the one or more first location identifiers indicate that data of the one or more second rows of the first column is stored in the query server memory device of the query server computer.

8. A method optimized for ordered data and read-dominated workloads of a computer data system with a plurality of memory devices, the method comprising:

storing at a first data server computer first data in a first memory device in a first column-oriented configuration;

storing at a second data server computer second data in a second memory device in a second column-oriented configuration;

storing at a third data server computer the third data in a third memory device in a third column-oriented configuration;

executing, at a query server computer, a database query, the query server computer comprising a query server memory device and being coupled to the first, second, and third data server computers, the executing comprising;

providing a table data cache proxy operable to optimize performance of computer data access to the first, second, and third data server computers by;

requesting a latest table state from two or more of the first, second, and third data server computers;

filtering the latest table state to generate a complete, non-duplicative composite table state that includes one of data or metadata from the two or more of the first, second, and third data server computers, wherein the non-duplicative composite table state includes table locations, and wherein the table data cache proxy is operable to filter table locations to be distributed to one or more remote query processors to interleave table locations from the first, second, and third data server computers and distribute subsequent data access across the first, second, and third data server computers; and

providing, from the table data cache proxy a single, non-composite service for table location;

accessing a table comprising first and second columns, one or more first rows, and one or more second rows, wherein a given location for the table is provided by the single, non-composite service,

storing one or more first location identifiers indicating where column data of the first column is stored and one or more second location identifiers indicating where column data of the second column is stored,

the one or more first location identifiers indicating that data of the one or more first rows of the first column is stored in the first memory device of the first data server computer,

the one or more second location identifiers indicating that data of the one or more first rows of the second column is stored in the second memory of the second data server computer and that data of the one or more second rows of the second column is stored in the third memory of the third data server computer, and

storing a table index comprising, for each location identifier of the one or more first location identifiers and the one or more second location identifiers, an index identifier indicating a valid portion of the data at the location indicated by the location identifier, wherein the valid portion of the data includes data corresponding to the rows of the table and excludes data not corresponding to the rows of the table, such that data corresponding to a combination of the first or second location identifiers and the index identifier comprises the table, and

wherein the first memory device includes shared memory and the second memory device is faster than the third memory device.

9. The method of claim 8, wherein the executing further comprises:

requesting one or more blocks of data of the first column from the first data server computer; and

requesting one or more blocks of data of the second column from the second or third data server computer.

10. The method of claim 8, wherein the executing further comprises:

requesting one or more blocks of data of the second column from the second data server computer; and

requesting one or more blocks of data of the second column from the third data server computer.

11. The method of claim 8, wherein the executing further comprises:

requesting one or more blocks of data of the one or more first rows from the first or second data server computers; and

requesting one or more blocks of data of the one or more second rows from the third data server computer.

12. The method of claim 8, wherein the executing further comprises:

requesting one or more blocks of data of the one or more first rows from the first data server computer; and

requesting one or more blocks of data of the one or more first rows from the second data server computer.

13. The method of claim 8, wherein the first memory device is a transitory memory device and the second memory device is a persistent memory device.

14. The method of claim 8, wherein the first memory device, the second memory device, and the third memory device are all different from each other.

15. The method of claim 8, wherein the one or more first location identifiers indicate that data of the one or more second rows of the first column is stored in the query server memory device of the query server computer.

23. The computer readable medium of claim 15, wherein the one or more first location identifiers indicating that data of the one or more second rows of the first column is stored in the query server memory device of the query server.

16. A nontransitory computer readable medium having stored thereon software instructions that, when executed by one or more processors, cause the processors to perform operations including:

storing at a first data server first data in a first memory device in a first column-oriented configuration;

storing at a second data server second data in a second memory device in a second column-oriented configuration;

storing at a third data server the third data in a third memory device in a third column-oriented configuration;

executing, at a query server, a database query, the query server comprising a query server memory device and being coupled to the first, second, and third data servers, the executing comprising;

providing a table data cache proxy operable to optimize performance of computer data access to the first, second, and third data server computers by;

requesting a latest table state from two or more of the first, second, and third data server computers;

filtering the latest table state to generate a complete, non-duplicative composite table state that includes one of data or metadata from the two or more of the first, second, and third data server computers, wherein the non-duplicative composite table state includes table locations, and wherein the table data cache proxy is operable to filter table locations to be distributed to one or more remote query processors to interleave table locations from the first, second, and third data server computers and distribute subsequent data access across the first, second, and third data server computers; and

providing, from the table data cache proxy a single, non-composite service for table location;

accessing a table comprising first and second columns, one or more first rows, and one or more second rows, wherein a given location for the table is provided by the single, non-composite service,

storing one or more first location identifiers indicating where column data of the first column is stored and one or more second location identifiers indicating where column data of the second column is stored,

the one or more first location identifiers indicating that data of the one or more first rows of the first column is stored in the first memory device of the first data server,

the one or more second location identifiers indicating that data of the one or more first rows of the second column is stored in the second memory device of the second data server and that data of the one or more second rows of the second column is stored in the third memory device of the third data server, and

storing a table index comprising, for each location identifier of the one or more first location identifiers and the one or more second location identifiers, an index identifier indicating a valid portion of the data at the location indicated by the location identifier, wherein the valid portion of the data includes data corresponding to the rows of the table and excludes data not corresponding to the rows of the table, such that data corresponding to a combination of the first or second location identifiers and the index identifier comprises the table, and

wherein the first memory device includes shared memory and the second memory device is faster than the third memory device.

17. The computer readable medium of claim 16, wherein the executing further comprises:

requesting one or more blocks of data of the first column from the first data server; and

requesting one or more blocks of data of the second column from the second or third data server.

18. The computer readable medium of claim 16, wherein the executing further comprises:

requesting one or more blocks of data of the second column from the second data server; and

requesting one or more blocks of data of the second column from the third data server.

19. The computer readable medium of claim 16, wherein the executing further comprises:

requesting one or more blocks of data of the one or more first rows from the first or second data server; and

requesting one or more blocks of data of the one or more second rows from the third data server.

20. The computer readable medium of claim 16, wherein the executing further comprises:

requesting one or more blocks of data of the one or more first rows from the first data server; and

requesting one or more blocks of data of the one or more first rows from the second data server.

21. The computer readable medium of claim 16, wherein the first memory device is a transitory memory device and the second memory device is a persistent memory device.

22. The computer readable medium of claim 16, wherein the first memory device, the second memory device, and the third memory device are all different from each other.