DATA STRUCTURE FOR HIGHLY EFFICIENT DATA QUERY

DATA STRUCTURE FOR HIGHLY EFFICIENT DATA QUERY

PROBLEM TO BE SOLVED: To provide an apparatus and method for highly efficient data queries. SOLUTION: A data structure is provided in a memory space (122) with a virtual data space (140) storing non-sequential entries and the first data array (142) of sequential entries. At least a first sequential...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: LUBBERS CLARK EDWARD, ROBERSON RANDY L
Format: Patent
Sprache:eng
Schlagworte:
CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:PROBLEM TO BE SOLVED: To provide an apparatus and method for highly efficient data queries. SOLUTION: A data structure is provided in a memory space (122) with a virtual data space (140) storing non-sequential entries and the first data array (142) of sequential entries. At least a first sequential entry of the data array (142) points to a skip list (144), at least a second sequential entry of the data array (142) points to a second data array (146), and at least a third sequential entry (148) of the data array (142) points to a selected non-sequential entry in the virtual data space (140). COPYRIGHT: (C)2009,JPO&INPIT