IP Library Granted Patent US 12,242,450
Granted Patent B2
US 12,242,450 · App. 18/330,756 · Granted Mar 4, 2025

Method and system for facilitating access to recorded data

Inventors: Max Prakoso (Haymarket, AU); Andi Hakim (Campsie, AU); Robert Lang (North Wahroonga, AU)
Assignee: NASDAQ TECHNOLOGY AB
G06F16/22G06F3/04842G06F16/185G06F16/24539G06F16/24552G06F16/54G06Q40/04G06T11/00G06V10/24G06V20/176G06V20/38G06V20/39
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,242,450
App. No.
18/330,756
Granted
Mar 4, 2025
Kind
B2
Abstract

The present invention relates to a method and system for facilitating access to recorded data. The system comprises an interface and a processing device. The interface is arranged to receive data and the processing device is arranged to separate the received data in data subsets, compress each data subset and assign an identifier to each compressed data subset, thereby creating data units each comprising a compressed data subset and an associated identifier, the processing device further being arranged to establish an index on the basis of the assigned identifiers.

Claims (78)

1. A system configured to access recorded data, the system comprising:

a processor;

a communication interface; and

a memory configured to store computer readable instructions that, when executed, cause the system to:

receive data via the communication interface;

separate the received data into data subsets;

compress each data subset, by applying a compression technique, such that each data subset includes compressed payload data;

create data units from each compressed data subset;

establish an index associated with the data units, wherein the index includes a plurality of index entries, and each index entry comprises:

an identifier;

timing parameters; and

memory address parameters of memory locations containing the data units, wherein the memory address parameters include at least a first memory address and a second memory address;

search the memory, for the data units, using the established index;

decompress the data units within a timing window using the timing parameters; and

generate a view that includes the decompressed data units within the timing window.

2. The system of claim 1 , wherein

the first memory address is a starting memory address,

the second memory address is an ending memory address, and

the timing parameters include a start time parameter and an end time parameter.

3. The system of claim 1 , wherein the view is generated in near real time.

4. The system of claim 1 , wherein the index indicates a physical memory location, in the memory, of each data unit.

5. The system of claim 1 , wherein

the memory includes a first memory and a second memory, and

the system is further caused to search in both the first memory, for real-time analysis, and the second memory, for historical analysis, using the established index.

6. The system of claim 1 , wherein the compression technique utilizes a software library associated with any of zlib, bzip2, or snappy.

7. The system of claim 1 , wherein the data subsets are configurable in size such that larger subsets translate to faster scan and smaller index while smaller subsets translate to slower scan and larger index.

8. A non-transitory computer readable storage medium configured to store computer readable instructions that, when executed by a processor of an information processing apparatus, cause the information processing apparatus to provide execution comprising:

receiving data and separating the received data into data subsets;

compressing each data subset, by applying a compression technique, such that each data subset includes compressed payload data;

creating data units from each compressed data subset;

establishing an index associated with the data units, wherein the index includes a plurality of index entries, and each index entry comprises:

an identifier;

timing parameters; and

memory address parameters of memory locations containing the data units;

searching the memory, for the data units, using the established index;

decompressing the data units within a timing window using the timing parameters; and

generating a view that includes the decompressed data units within the timing window.

9. The non-transitory computer readable storage medium of claim 8 , wherein the memory address parameters include at least a first memory address and a second memory address.

10. The non-transitory computer readable storage medium of claim 8 , wherein

the first memory address is a starting memory address,

the second memory address is an ending memory address, and

the timing parameters include a start time parameter and an end time parameter.

11. The non-transitory computer readable storage medium of claim 8 , wherein

the memory includes a first memory and a second memory, and

the information processing apparatus is further caused to provide execution comprising searching in both the first memory, for real-time analysis, and the second memory, for historical analysis, using the established index.

12. A method for accessing recorded data, the method comprising:

at an information processing system having a processor and a memory:

receiving data and separating the received data into data subsets;

compressing each data subset, by applying a compression technique, such that each data subset includes compressed payload data;

creating data units from each compressed data subset;

establishing an index associated with the data units, wherein the index includes a plurality of index entries, and each index entry comprises:

an identifier;

timing parameters; and

memory address parameters of memory locations containing the data units;

searching the memory, for the data units, using the established index; and

decompressing the data units within a timing window using the timing parameters.

13. The method of claim 12 , further comprising:

generating a view that includes the decompressed data units within the timing window.

14. The method of claim 12 , wherein the memory address parameters include at least a first memory address and a second memory address.

15. The method of claim 14 , wherein

the first memory address is a starting memory address,

the second memory address is an ending memory address, and

the timing parameters include a start time parameter and an end time parameter.

16. The method of claim 12 , wherein

the memory includes a first memory and a second memory, and

the method further comprises searching in both the first memory, for real-time analysis, and the second memory, for historical analysis, using the established index.

17. The method of claim 16 , wherein

the first memory is configured to store the data units, and

the stored data units are transferred from the first memory to the second memory in association with a memory utilization degree reaching a threshold value.

18. The non-transitory computer readable storage medium of claim 11 , wherein

the first memory is configured to store the data units, and

the stored data units are transferred from the first memory to the second memory when a memory utilization degree reaches a threshold value.

19. The system of claim 5 , wherein

the first memory is configured to store the data units, and

the stored data units are transferred from the first memory to the second memory when a memory utilization degree reaches a threshold value.

20. The system of claim 5 , wherein

the first memory is configured to store the data units, and

the stored data units are transferred from the first memory to the second memory in association with a memory flush instruction.

Assignments (2)
CHANGE OF NAME Recorded Jun 12, 2023
From: OMX TECHNOLOGY AB
To: NASDAQ TECHNOLOGY AB
Reel/Frame 064181/0629 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 7, 2023
From: PRAKOSO, MAX ROY; HAKIM, ANDI R.; LANG, ROBERT
To: OMX TECHNOLOGY AB
Reel/Frame 063884/0987 →
Continuity (4)
Continuation 17557463 · Dec 21, 2021
Continuation 16392918 · Apr 24, 2019
Continuation 13419692 · Mar 14, 2012
Related Publication 20230316743A1 · Oct 5, 2023
References Cited (26)
US 6006232A · Lyons · 1999 [cited by applicant]
US 8301785B2 · Jeong · 2012 [cited by applicant]
US 9081829B2 · Bhave · 2015 [cited by examiner]
US 20020061029A1 · Dillon · 2002 [cited by examiner]
US 20030014399A1 · Hansen et al. · 2003 [cited by applicant]
US 20050192994A1 · Caldwell · 2005 [cited by examiner]
US 20070130226A1 · Banerjee · 2007 [cited by examiner]
US 20080183737A1 · Bhalotia · 2008 [cited by examiner]
US 20080215546A1 · Baum · 2008 [cited by examiner]
US 20080222111A1 · Hoang et al. · 2008 [cited by applicant]
US 20080229037A1 · Bunte · 2008 [cited by examiner]
US 20090307249A1 · Koifman · 2009 [cited by examiner]
US 20100082417A1 · Wu · 2010 [cited by examiner]
US 20100332379A1 · Ram · 2010 [cited by examiner]
US 20110131347A1 · Marshall · 2011 [cited by examiner]
US 20110202497A1 · Marschall · 2011 [cited by examiner]
US 20120047264A1 · Parthasarathy et al. · 2012 [cited by applicant]
US 20120130995A1 · Risvik et al. · 2012 [cited by applicant]
US 20120330931A1 · Nakano · 2012 [cited by examiner]
US 20130047169A1 · Gagliardi et al. · 2013 [cited by applicant]
US 20130159281A1 · Yang et al. · 2013 [cited by applicant]
EP 0996126A1 · 2000 [cited by applicant]
Nunez et al., “Lossless data compression programmable hardware for high-speed data networks,” 2002 IEEE International Conference on Field-Programmable Technology, 2002. (FPT). China, 2002, pp. 290-293, doi: 10.1109/FPT.… [cited by examiner]
International Search Report and Written Opinion of the International Searching Authority dated Jun. 26, 2013 in International Application No. PCT/EP2013/054992. [cited by applicant]
T.R. Haining, et al., “Management Policies for Non-Volatile Write Caches”, Performance, Computing and Communications Conference, 1999 IEEE International, Feb. 10, 1999, XP010323665, pp. 324-325. [cited by applicant]
IBM: “Tivoli Storage Manager for HSM for Windows Version 6.1”, Jan. 1, 2010, pp. 1-176, XP055010002, URL:http://publib.boulder.ibm.com/infocenter/tsminfo/v6/topic/com.ibm.itsm.hsmwin.doc/b_hsm_guide_win.pdf. [cited by applicant]