Query task processing based on memory allocation and performance criteria

• US 10,552,412 B2
• Filed: 03/03/2017
• Issued: 02/04/2020
• Est. Priority Date: 05/14/2015
• Status: Active Grant

• Current Assignee: Deephaven Data Labs, LLC
• Original Assignee: Deephaven Data Labs, LLC
• Inventors: Wright, Charles, Caudy, Ryan, Kent, IV, David R., Zeldis, Mark, Teodorescu, Radu
• Primary Examiner(s): Torgrimson, Tyler J
• Application Number:
  US15/448,930
• Publication Number:
  US 20170177677A1
• Time in Patent Office: 1,068 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 query task operations based on memory allocation and performance criteria.

Claims

1. A system for maximizing memory and processing efficiencies in a computer system, the system comprising:

one or more processors; and

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;

receiving, at one of the one or more processors, a digital request from a client computer;

creating and storing, in a computer storage, data in a plurality of column sources;

creating and storing, in a computer memory a first table object index mapping data in the plurality of column sources to a first table object, the computer memory having faster access time than the computer storage; and

at the one of the one or more processors, providing operations including;

a select query operation, the select query operation comprising;

receiving a select query task to assign to a second table object a subset of rows from one or more of the plurality of column sources from the first table object;

creating and storing, in the computer memory separate from the computer storage, the second table object;

creating and storing, in the computer memory, a copy of the subset of rows assigned to the second table object;

creating and storing in the computer memory separate from the computer storage a second table object index mapping the copy of the subset of rows assigned to the second table object to the one or more of the plurality of column sources from the first table object; and

storing, in a result column in the computer storage, a result set from executing a formula in the form of a subset of rows assigned to the second table object, thereby eliminating repeat processing time for re-executing the formula and providing faster access to the subset of rows assigned to the second table object than access provided via repeat processing for re-executing the formula.

2. The system of claim 1, wherein the first table object index is arranged according to a strict ordering.

3. A system comprising:

one or more processors; and

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;

receiving, at one of the one or more processors, on a query server computer, a digital request from a client computer;

creating and storing, in a computer storage, data in a plurality of column sources;

creating and storing in a computer memory a first table object index mapping data in the plurality of column sources to a first table object, the computer memory having faster access time than the computer storage; and

at the one of the one or more processors, providing operations including;

an update query operation, the update query operation comprising;

receiving an update query task to assign to a second table object a subset of rows from all of the plurality of column sources from the first table object;

creating and storing in the computer memory separate from the computer storage, the second table object;

accessing in the computer memory separate from the computer storage the first table object index to the subset of rows assigned to the second table object; and

storing, for a-result column in the computer storage, a result set from executing a formula in the form of a map, thereby reducing repeat processing time for re-executing the formula.

4. The system of claim 3, wherein the first table object index is arranged according to a strict ordering.

5. A system comprising:

one or more processors; and

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;

receiving, at one of the one or more processors, on a query server computer, a digital request from a client computer;

creating and storing, in a computer storage, data in a plurality of column sources;

creating and storing in a computer memory a first table object index mapping data in the plurality of column sources to a first table object, the computer memory having faster access time than the computer storage; and

at the one of the one or more processors, providing operations including;

a view query operation, the view query operation comprising;

receiving a query task to assign to a second table object a subset of rows from one or more of the plurality of column sources from the first table object;

creating and storing in the computer memory separate from the computer storage, the second table object;

accessing in the computer memory separate from the computer storage the first table object index to the subset of rows assigned to the second table object; and

storing, for a-result column in the computer storage, a formula configured to generate a result set, thereby reducing use of computer memory.

6. The system of claim 5, wherein the first table object index is arranged according to a strict ordering.

7. A system comprising:

one or more processors; and

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;

receiving, at one of the one or more processors, on a query server computer, a digital request from a client computer;

creating and storing, in a computer storage, data in a plurality of column sources;

creating and storing in a computer memory a first table object index mapping data in the plurality of column sources to a first table object, the computer memory having faster access time than the computer storage; and

at the one of the one or more processors, providing operations including;

an update view query operation, the update view query operation comprising;

receiving a query task to assign to a second table object a subset of rows from all of the plurality of column sources from the first table object;

creating and storing in the computer memory separate from the computer storage, the second table object;

accessing in the computer memory separate from the computer storage the first table object index to the subset of rows assigned to the second table object; and

storing, for a result column in the computer storage, a formula configured to generate a result set, thereby reducing use of computer memory.

8. The system of claim 7, wherein the first table object index is arranged according to a strict ordering.

9. A method comprising:

creating and storing, in a computer storage data, a plurality of column sources;

creating and storing, in a computer memory, a first table object index mapping data in the plurality of column sources to a first table object, the computer memory having faster access time than the computer storage; and

providing operations including;

a select query operation, the select query operation comprising;

receiving a select query task to assign to a second table object a subset of rows from one or more of the plurality of column sources from the first table object;

creating and storing, in the computer memory separate from the computer storage, the second table object;

creating and storing, in the computer memory, a copy of the subset of rows assigned to the second table object;

creating and storing in the computer memory separate from the computer storage a second table object index mapping the copy of the subset of rows assigned to the second table object to the one or more of the plurality of column sources from the first table object; and

storing, for a result column in the computer storage, a result set from executing a formula in the form of a subset of rows assigned to the second table object, thereby eliminating repeat processing time for re-executing the formula and providing faster access to the subset of rows assigned to the second table object than access provided via repeat processing for re-executing the formula.

10. The method of claim 9, wherein the first table object index is arranged according to a strict ordering.

11. A method comprising:

creating and storing in a computer storage data in a plurality of column sources;

creating and storing in a computer memory a first table object index mapping data in the plurality of column sources to a first table object, the computer memory having faster access time than the computer storage; and

providing operations including;

an update query operation, the update query operation comprising;

receiving an update query task to assign to a second table object a subset of rows from all of the plurality of column sources from the first table object;

creating and storing in the computer memory separate from the computer storage, the second table object;

accessing in the computer memory separate from the computer storage the first table object index to the subset of rows assigned to the second table object; and

storing, for a-result column in the computer storage, a result set from executing a formula in the form of a map, thereby reducing repeat processing time for re-executing the formula.

12. The method of claim 11, wherein the first table object index is arranged according to a strict ordering.

13. A method comprising:

creating and storing in a computer storage data in a plurality of column sources;

creating and storing in a computer memory a first table object index mapping data in the plurality of column sources to a first table object, the computer memory having faster access time than the computer storage; and

providing operations including;

a view query operation, the view query operation comprising;

receiving a query task to assign to a second table object a subset of rows from one or more of the plurality of column sources from the first table object;

creating and storing in the computer memory separate from the computer storage, the second table object;

accessing in the computer memory separate from the computer storage the first table object index to the subset of rows assigned to the second table object; and

storing, for a result column in the computer storage, a formula configured to generate a result set, thereby reducing use of computer memory.

14. The method of claim 13, wherein the first table object index is arranged according to a strict ordering.

15. A method comprising:

creating and storing in a computer storage data in a plurality of column sources;

creating and storing in a computer memory a first table object index mapping data in the plurality of column sources to a first table object, the computer memory having faster access time than the computer storage; and

providing operations including;

an update view query operation, the update view query operation comprising;

receiving an update view query task to assign to a second table object a subset of rows from all of the plurality of column sources from the first table object;

creating and storing in the computer memory separate from the computer storage, the second table object;

accessing in the computer memory separate from the computer storage the first table object index to the subset of rows assigned to the second table object; and

storing, for a-result column in the computer storage, a formula configured to generate a result set, thereby reducing use of computer memory.

16. The method of claim 15, wherein the first table object index is arranged according to a strict ordering.

17. A method comprising:

storing, in a computer memory, a first table object index mapping data in a plurality of column sources to a first table object, the data in the plurality of column sources being stored in a computer storage; and

providing operations including;

a query operation, the query operation comprising;

receiving a query task to assign to a second table object a subset of rows from one or more of the plurality of column sources from the first table object;

creating and storing in the computer memory the second table object;

creating and storing in the computer memory a copy of the subset of rows assigned to the second table object;

creating and storing in the computer memory a second table object index mapping the copy of the subset of rows assigned to the second table object to the one or more of the plurality of column sources from the first table object; and

storing, for a result column in the computer storage, a result set from executing a formula of the first table, thereby eliminating repeat processing time for re-executing the formula and providing faster access to the subset of rows assigned to the second table object than access provided via repeat processing for re-executing the formula.

18. The method of claim 17, wherein the first table object index is arranged according to a strict ordering.

19. The method of claim 17, wherein the storing a result set from executing a formula comprises storing the result set in the form of a subset of rows assigned to the second table object.

20. The method of claim 17, wherein the computer storage is a type of memory different than that of the computer memory.

21. A method comprising:

storing, in a computer memory, a first table object index mapping data in a plurality of column sources to a first table object, the data in the plurality of column sources being stored in a computer storage; and

providing operations including;

a query operation, the query operation comprising;

receiving a query task to assign to a second table object a subset of rows from one or more of the plurality of column sources from the first table object;

creating and storing in the computer memory the second table object;

creating and storing in the computer memory a second table object index mapping the subset of rows assigned to the second table object to the one or more of the plurality of column sources from the first table object; and

storing, for a result column in the computer storage, a result set from executing a formula of the first table, thereby eliminating repeat processing time for re-executing the formula and providing faster access to the subset of rows assigned to the second table object than access provided via repeat processing for re-executing the formula.

22. The method of claim 21, wherein the first table object index is arranged according to a strict ordering.

23. The method of claim 21, wherein the storing a result set from executing a formula comprises storing the result set in the form of a map.

24. The method of claim 21, wherein the receiving comprises receiving the query task to assign to the second table object a subset of rows from all of the plurality of column sources from the first table object.

25. The method of claim 21, wherein the computer storage is a type of memory different than that of the computer memory.

26. A method comprising:

storing, in a computer memory, a first table object index mapping data in a plurality of column sources to a first table object, the data in the plurality of column sources being stored in a computer storage, wherein the first table object index is arranged according to a strict ordering; and

providing operations including;

a query operation, the query operation comprising;

receiving a query task to assign to a second table object a subset of rows from one or more of the plurality of column sources from the first table object;

creating and storing in the computer memory the second table object;

accessing in the computer memory the first table object index to the subset of rows assigned to the second table object; and

storing, for a result column in the computer storage, a formula configured to generate a result set, thereby reducing use of computer memory.

27. The method of claim 26, wherein the receiving comprises receiving the query task to assign to the second table object a subset of rows from all of the plurality of column sources from the first table object.

28. The method of claim 26, wherein the computer storage is a type of memory different than that of the computer memory.

29. A system comprising:

one or more processors; and

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, in a computer memory, a first table object index mapping data in a plurality of column sources to a first table object, the data in the plurality of column sources being stored in a computer storage; and

providing operations including;

a query operation, the query operation comprising;

receiving a query task to assign to a second table object a subset of rows from one or more of the plurality of column sources from the first table object;

creating and storing in the computer memory the second table object;

creating and storing in the computer memory a copy of the subset of rows assigned to the second table object;

creating and storing in the computer memory a second table object index mapping the copy of the subset of rows assigned to the second table object to the one or more of the plurality of column sources from the first table object; and

storing a result column including storing a result set from executing a formula of the first table, thereby eliminating repeat processing time for re-executing the formula and providing faster access to the subset of rows assigned to the second table object than access provided via repeat processing for re-executing the formula.

30. The system of claim 29, wherein the first table object index is arranged according to a strict ordering.

31. The system of claim 29, wherein the storing a result set from executing a formula comprises storing the result set in the form of a subset of rows assigned to the second table object.

32. The system of claim 29, wherein the computer storage is a type of memory different than that of the computer memory.

33. A system comprising:

one or more processors; and

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, in a computer memory, a first table object index mapping data in a plurality of column sources to a first table object, the data in the plurality of column sources being stored in a computer storage; and

providing operations including;

a query operation, the query operation comprising;

receiving a query task to assign to a second table object a subset of rows from one or more of the plurality of column sources from the first table object;

creating and storing in the computer memory the second table object;

creating and storing in the computer memory a second table object index mapping the subset of rows assigned to the second table object to the one or more of the plurality of column sources from the first table object; and

storing a result column including storing a result set from executing a formula of the first table, thereby eliminating repeat processing time for re-executing the formula and providing faster access to the subset of rows assigned to the second table object than access provided via repeat processing for re-executing the formula.

34. The system of claim 33, wherein the first table object index is arranged according to a strict ordering.

35. The system of claim 33, wherein the storing a result set from executing a formula comprises storing the result set in the form of a map.

36. The system of claim 33, wherein the receiving comprises receiving the query task to assign to the second table object a subset of rows from all of the plurality of column sources from the first table object.

37. The system of claim 33, wherein the computer storage is a type of memory different than that of the computer memory.

38. A system comprising:

one or more processors; and

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, in a computer memory, a first table object index mapping data in a plurality of column sources to a first table object, the data in the plurality of column sources being stored in a computer storage, wherein the first table object index is arranged according to a strict ordering; and

providing operations including;

a query operation, the query operation comprising;

receiving a query task to assign to a second table object a subset of rows from one or more of the plurality of column sources from the first table object;

creating and storing in the computer memory the second table object;

accessing in the computer memory the first table object index to the subset of rows assigned to the second table object; and

storing a result column including storing a formula configured to generate a result set, thereby reducing use of computer memory.

39. The system of claim 38, wherein the receiving comprises receiving the query task to assign to the second table object a subset of rows from all of the plurality of column sources from the first table object.

40. The system of claim 38, wherein the computer storage is a type of memory different than that of the computer memory.

41. A system comprising:

one or more processors; and

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, in a computer memory, a first table object index mapping data in a plurality of column sources to a first table object, the data in the plurality of column sources being stored in a computer storage; and

providing operations including;

a query operation, the query operation comprising;

receiving a query task to assign to a second table object a subset of rows from all of the plurality of column sources from the first table object;

creating and storing in the computer memory the second table object;

accessing in the computer memory the first table object index to the subset of rows assigned to the second table object; and

storing a result column including storing a formula configured to generate a result set, thereby reducing use of computer memory.

42. A method comprising:

storing, in a computer memory, a first table object index mapping data in a plurality of column sources to a first table object, the data in the plurality of column sources being stored in a computer storage; and

providing operations including;

a query operation, the query operation comprising;

receiving a query task to assign to a second table object a subset of rows from all of the plurality of column sources from the first table object;

creating and storing in the computer memory the second table object;

accessing in the computer memory the first table object index to the subset of rows assigned to the second table object; and

storing, for a result column in the computer storage, a formula configured to generate a result set, thereby reducing use of computer memory.