Dynamic filter processing

• US 9,672,238 B2
• Filed: 05/14/2016
• Issued: 06/06/2017
• Est. Priority Date: 05/14/2015
• Status: Active Grant

• Current Assignee: Deephaven Data Labs, LLC
• Original Assignee: Walleye Software LLC
• Inventors: Caudy, Ryan, Bronnimann, Herve, Kent, IV, David R., Zeldis, Mark, Teodorescu, Radu, Wright, Charles
• Primary Examiner(s): VU, BAI DUC
• Application Number:
  US15/154,987
• Publication Number:
  US 20160335307A1
• Time in Patent Office: 388 Days
• Field of Search: None
• 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

The disclosed subject matter includes systems, methods, and computer readable medium for automatically updating data source objects (DSO). First and second DSO can be created and mapped to first and second data, respectively. A third DSO can be created and mapped to the first subset of the first stored data by filtering the first stored data mapped to the first DSO with the second stored data mapped to the second DSO. A listener can be created for the third DSO to detect changes to the first DSO. Listener can receive notification of a change to the first DSO. the mapping of the third DSO can be updated by applying the change. A remapping can be requested of the third DSO to a second subset of first stored data by filtering the first stored data mapped to the first DSO with the second stored data mapped to the second DSO.

Claims

1. A system for automatically updating data source objects, the system comprising:

one or more hardware processors;

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

creating a first data source object in a first memory;

mapping the first data source object to a first stored data;

creating a second data source object in a second memory;

the second data source object different than the first data source object;

mapping the second data source object to a second stored data;

creating a third data source object in a third memory, the third data source object different than the first data source object and the second data source object;

mapping the third data source object to a first subset of the first stored data by filtering the first stored data mapped to the first data source object with the second stored data mapped to the second data source object;

creating a first listener for the third data source object in a fourth memory;

listening with the first listener for one or more changes to the first data source object;

making one or more changes to the first data source object;

detecting by the first listener-of one or more changes to the first data source object;

receiving a notification from the first listener of a change to the first data source object;

updating the mapping of the third data source object by applying the one or more changes to the first data source object;

creating a second listener for the second data source object in a fifth memory;

listening with the second listener for one or more changes to the second data source object;

making one or more changes to the second data source object;

detecting by the second listener of one or more changes to the second data source object;

receiving a notification of one or more changes to the second data source object;

requesting a remapping of the third data source object to a second subset of first stored data by filtering the first stored data mapped to the first data source object with the second stored data mapped to the second data source object; and

updating the mapping of the third data source object to a subset of first stored data by filtering the first stored data mapped to the first data source object with the second stored data mapped to the second data source object.

2. The system of claim 1, wherein the mapping the third data source object to a first subset of the first stored data by filtering the first stored data mapped to the first data source object with the second stored data mapped to the second data source object includes selecting a set of rows from the first stored data with one or more key values that are present in the second stored data.

3. The system of claim 1, wherein the mapping the third data source object to a first subset of the first stored data by filtering the first stored data mapped to the first data source object with the second stored data mapped to the second data source object includes selecting a set of rows form the first stored data with one or more key values that are not present in the second stored data.

4. The system of claim 1, the operations further comprising:

determining whether to request a remapping of the third data source object to a second subset of first stored data by filtering the first stored data mapped to the first data source object with the second stored data mapped to the second data source object, the determination based on whether the one or more changes to the second data source object effected an overall change in the second data source;

wherein the updating the mapping of the third data source object to a subset of first stored data by filtering the first stored data mapped to the first data source object with the second stored data mapped to the second data source object is performed only when the one or more changes to the second data source object effected an overall change in the second data source.

5. The system of claim 1, wherein the change to the first data source object includes at least

re-indexing the rows of the first data source object.

6. The system of claim 1, wherein a change to the second data source object includes at least one of:

adding a row to the second data source object;

deleting a row from the second data source object;

changing the data in a row of the second data source object; and

re-indexing the rows of the second data source object.

7. The system of claim 1, wherein the first memory, the second memory, the third memory, the fourth memory, and the fifth memory are all different.

8. The system of claim 1, the operations further comprising:

sending a notification message of changes to the third data source object to any downstream listeners of one or more children created from operations on the third data source object.

9. The system of claim 1,

wherein the remapping includes remapping of the third data source object to a second subset of first stored data by full data filtering the first stored data mapped to the first data source object with the second stored data mapped to the second data source object;

and

wherein the first data source object is different than the second data source object.

10. A method for using a computer system to automatically update data source objects, the method comprising:

creating, by a processor, a first data source object in a first memory;

mapping the first data source object to a first stored data;

creating a second data source object in a second memory;

mapping the second data source object to a second stored data;

creating a third data source object in a third memory;

mapping the third data source object to a first subset of the first stored data by filtering the first stored data mapped to the first data source object with the second stored data mapped to the second data source object;

creating a first listener for the third data source object in a fourth memory;

listening with the first listener for one or more changes to the first data source object;

making one or more changes to the first data source object;

detecting by the first listener of one or more changes to the first data source object;

receiving a notification from the first listener of the change to the first data source object;

updating the mapping of the third data source object by applying the one or more changes to the first data source object;

creating a second listener for the second data source object in a fifth memory;

listening with the second listener for one or more changes to the second data source obiect;

making one or more changes to the second data source object;

detecting by the second listener of one or more changes to the second data source object;

receiving a notification of one or more changes to the second data source object;

requesting a remapping of the third data source object to a second subset of first stored data by filtering the first stored data mapped to the first data source object with the second stored data mapped to the second data source object; and

updating the mapping of the third data source object to a subset of first stored data by filtering the first stored data mapped to the first data source object with the second stored data mapped to the second data source object.

11. The method of claim 10, wherein the mapping the third data source object to a first subset of the first stored data by filtering the first stored data mapped to the first data source object with the second stored data mapped to the second data source object includes selecting a set of rows from the first stored data with one or more key values that are present in the second stored data.

12. The method of claim 10, wherein the mapping the third data source object to a first subset of the first stored data by filtering the first stored data mapped to the first data source object with the second stored data mapped to the second data source object includes selecting a set of rows form the first stored data with one or more key values that are not present in the second stored data.

13. The method of claim 10, further comprising:

determining whether to request a remapping of the third data source object to a second subset of first stored data by filtering the first stored data mapped to the first data source object with the second stored data mapped to the second data source object, the determination based on whether the one or more changes to the second data source object effected an overall change in the second data source;

wherein the updating the mapping of the third data source object to a subset of first stored data by filtering the first stored data mapped to the first data source object with the second stored data mapped to the second data source object is performed only when the one or more changes to the second data source object effected an overall change in the second data source.

14. The method of claim 10, wherein a change to the first data source object includes at least

re-indexing the rows of the first data source object.

15. The method of claim 10, wherein a change to the second data source object includes at least one of:

adding a row to the second data source object;

deleting a row from the second data source object;

changing the data in a row of the second data source object; and

re-indexing the rows of the second data source object.

16. The method of claim 10, wherein the first memory, the second memory, the third memory, the fourth memory, and the fifth memory are all different.

17. The method of claim 10, further comprising:

sending a notification message of changes to the third data source object to any downstream listeners of one or more children created from operations on the third data source object.

18. The method of claim 10, the operations further comprising:

wherein the remapping includes remapping of the third data source object to a second subset of first stored data by full data filtering the first stored data mapped to the first data source object with the second stored data mapped to the second data source object; and

wherein the first data source object is different than the second data source object.

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

creating a first data source object in a first memory;

mapping the first data source object to a first stored data;

creating a second data source object in a second memory;

mapping the second data source object to a second stored data;

creating a third data source object in a third memory;

mapping the third data source object to a first subset of the first stored data by filtering the first stored data mapped to the first data source object with the second stored data mapped to the second data source object;

creating a first listener for the third data source object in a fourth memory;

listening with the first listener for one or more changes to the first data source object;

making one or more changes to the first data source object;

detecting by the first listener of one or more changes to the first data source object;

receiving a notification from the first listener of the change to the first data source object;

updating the mapping of the third data source object by applying the one or more changes to the first data source object;

creating a second listener for the second data source object in a fifth memory;

listening with the second listener for one or more changes to the second data source object;

making one or more changes to the second data source object;

detecting by the second listener of one or more changes to the second data source object;

receiving a notification of one or more changes to the second data source object;

requesting a remapping of the third data source object to a second subset of first stored data by filtering the first stored data mapped to the first data source object with the second stored data mapped to the second data source object; and

updating the mapping of the third data source object to a subset of first stored data by filtering the first stored data mapped to the first data source object with the second stored data mapped to the second data source object.

20. The non-transitory computer readable medium of claim 19, wherein mapping the third data source object to a first subset of the first stored data by filtering the first stored data mapped to the first data source object with the second stored data mapped to the second data source object includes selecting a set of rows from the first stored data with one or more key values that are present in the second stored data.

21. The non-transitory computer readable medium of claim 19, the operations further comprising:

determining whether to request a remapping of the third data source object to a second subset of first stored data by filtering the first stored data mapped to the first data source object with the second stored data mapped to the second data source object, the determination based on whether the one or more changes to the second data source object effected an overall change in the second data source;

wherein the updating the mapping of the third data source object to a subset of first stored data by filtering the first stored data mapped to the first data source object with the second stored data mapped to the second data source object is performed only when the one or more changes to the second data source object effected an overall change in the second data source.

22. The non-transitory computer readable medium of claim 19, wherein a change to the first data source object includes at least

re-indexing the rows of the first data source object.

23. The non-transitory computer readable medium of claim 19, wherein a change to the second data source object includes at least one of:

adding a row to the second data source object;

deleting a row from the second data source object;

changing the data in a row of the second data source object; and

re-indexing the rows of the second data source object.

24. The non-transitory computer readable medium of claim 19, wherein the first memory, the second memory, the third memory, the fourth memory, and the fifth memory are all different.

25. The non-transitory computer readable medium of claim 19, the operations further comprising:

sending a notification message of changes to the third data source object to any downstream listeners of one or more children created from operations on the third data source object.

26. The non-transitory computer readable medium of claim 19, the operations further comprising:

wherein the remapping includes remapping of the third data source object to a second subset of first stored data by full data filtering the first stored data mapped to the first data source object with the second stored data mapped to the second data source object; and

wherein the first data source object is different than the second data source object.