# US 2019/0171737 A1 · Spatial-Temporal Query for Cognitive IoT Contexts

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2019/0171737 A1
- Document ID: US20190171737A1
- Status: Published application
- Kind: A1
- Application number: 15/829,857
- Filed: 2017-12-01
- Published: 2019-06-06
- Earliest claimed: 2017-12-01
- Assignees: International Business Machines Corporation
- Applicants: International Business Machines Corporation
- Inventors: Ning Duan; Chun Yang Ma; Makoto Tanibayashi; Zhi Hu Wang; Shoichiro Watanabe; Nan Xia; Xin Zhang; Jun Zhu
- Web page: https://patentgrep.com/patent/US20190171737A1

## CPC

- G06F 16/2264: {Multidimensional index structures}
- G06F 16/2365: {Ensuring data consistency and integrity}
- G06F 16/278: {Data partitioning, e.g. horizontal or vertical partitioning}
- G06F 16/283: {Multi-dimensional databases or data warehouses, e.g. MOLAP or ROLAP}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A method and/or system for managing a database that stores space-time context objects is provided. The system receives a query range in a multi-dimensional space. The system maps the query range into a set of fragments of a space-filling curve that fills the multi-dimensional space in all dimensions of the multi-dimensional space. The system uses each mapped fragment in the set of mapped fragments as a key to query the database for space-time context objects that are mapped to the space-filling curve. The system queries the database by identifying one or more context objects that intersect the mapped fragment at the space-filling curve.

## Claims

### Claim 1

A computer-implemented method comprising:
receiving a query range in a multi-dimensional space;
mapping the query range into a set of fragments of a space-filling curve that fills the multi-dimensional space; and
using each mapped fragment in the set of mapped fragments as a key to query a database for context objects stored in a computer readable storage medium.

### Claim 2 (depends on 1)

The computer-implemented method of claim 1, wherein the multi-dimensional space comprises two spatial dimensions and one temporal dimension, wherein the space-filling curve is a three-dimensional (3D) Hilbert space-filling curve.

### Claim 3 (depends on 1)

The computer-implemented method of claim 1:
wherein the context objects are mapped to the space-filling curve, and
wherein using a mapped fragment of the set of mapped fragments as a key to query the database comprises identifying one or more context objects that intersect the mapped fragment at the space-filling curve.

### Claim 4 (depends on 1)

The computer-implemented method of claim 1:
wherein the multi-dimensional space is recursively partitioned into a hierarchy of partitions at multiple levels,
wherein each level of partitions includes partitions that are ordered according to the space-filling curve, and
wherein each partition of a level is sub-divided into a further level of partitions.

### Claim 5 (depends on 4)

The computer-implemented method of claim 4, wherein mapping the query range into fragments of the space-filling curve comprises:
identifying partitions that fall entirely within the query range; and
reporting fragments of the space-filling curve that correspond to the identified partitions as mapped fragments for the query range.

### Claim 6 (depends on 4)

The computer-implemented method of claim 4, wherein mapping the query range into fragments of the space-filling curve comprises:
identifying partitions that are at a particular level of the partitions that intersect the query range; and
reporting fragments of the space-filling curve that correspond to the identified partitions as mapped fragments for the query range.

### Claim 7 (depends on 6)

The computer-implemented method of claim 6:
wherein reporting a fragment comprises identifying a sequence of one or more order values, and
wherein each order value in the sequence corresponds to a position of a partition at a level of the space-filling curve.

### Claim 8 (depends on 1)

The computer-implemented method of claim 1, wherein mapping the query range into the set of fragments comprises optimizing the set of fragments by reducing the number of fragments in the set of fragments by identifying and combining fragments that intersect each other in the space-filling curve.

### Claim 9

A computing device comprising:
a processor;
a first storage device storing a set of instructions, wherein an execution of the set of instructions by the processor configures the computing device to perform acts, comprising:
receiving a query range in a multi-dimensional space;
mapping the query range into a set of fragments of a space-filling curve that fills the multi-dimensional space; and
using each mapped fragment in the set of mapped fragments as a key to query a database for context objects; and
a second storage device storing the context objects of the database.

### Claim 10 (depends on 9)

The computing device of claim 9, wherein the database comprises context objects that are mapped to the space-filling curve, wherein using a mapped fragment to query the database comprises identifying one or more context objects that intersect the mapped fragment at the space-filling curve.

### Claim 11 (depends on 9)

The computing device of claim 9:
wherein the multi-dimensional space is recursively partitioned into a hierarchy of partitions at multiple levels,
wherein each level of partitions of the set of mapped fragments as a key includes partitions that are ordered according to the space-filling curve, and
wherein each partition of a level is sub-divided into a further level of partitions.

### Claim 12 (depends on 11)

The computing device of claim 11, wherein mapping the query range into fragments of the space-filling curve comprises:
identifying partitions that fall entirely within the query range; and
reporting fragments of the space-filling curve that correspond to the identified partitions, as mapped fragments for the query range.

### Claim 13 (depends on 11)

The computing device of claim 11, wherein mapping the query range into fragments of the space-filling curve comprises:
identifying partitions that are at a particular level of the partitions that intersect the query range; and
reporting fragments of the space-filling curve that correspond to the identified partitions as mapped fragments for the query range.

### Claim 14 (depends on 9)

The computing device of claim 9, wherein mapping the query range into the set of fragments comprises optimizing the set of fragments by reducing the number of fragments in the set of fragments by identifying and combining fragments that intersect each other in the space-filling curve.

### Claim 15

A computer program product comprising:
a non-transitory computer-readable storage device having program instructions stored thereon, the program instructions being executable by a processor, the program instructions comprising sets of instructions for:
receiving a context object having a context range in a multi-dimensional space;
mapping the context range into a set of fragments of a space-filling curve that fills the multi-dimensional space; and
storing the context object in a database by using each mapped fragment as an index.

### Claim 16 (depends on 15)

The computer program product of claim 15:
wherein the multi-dimensional space comprises two spatial dimensions and one temporal dimension, and
wherein the space-filling curve is a three-dimensional (3D) Hilbert space-filling curve.

### Claim 17 (depends on 15)

The computer program product of claim 15:
wherein the multi-dimensional space is recursively partitioned into a hierarchy of partitions at multiple levels,
wherein each level of partitions includes partitions that are ordered according to the space-filling curve, and
wherein each partition of a level is sub-divided into a further level of partitions.

### Claim 18 (depends on 17)

The computer program product of claim 17, wherein the set of instructions for mapping the context range into fragments of the space-filling curve further comprises sets of instructions for:
identifying partitions that fall entirely within the context range; and
reporting fragments of the space-filling curve that correspond to the identified partitions as mapped fragments for the context range.

### Claim 19 (depends on 17)

The computer program product of claim 17, wherein the set of instructions for mapping the context range into fragments of the space-filling curve comprises sets of instructions for:
identifying partitions that are at a particular level of the partitions that intersect the context range; and
reporting fragments of the space-filling curve that correspond to the identified partitions as mapped fragments for the context range.

### Claim 20 (depends on 15)

The computer program product of claim 15, wherein the set of instructions for mapping the context range into the set of fragments comprises sets of instructions for optimizing the set of fragments by reducing a number of fragments in the set of fragments by identifying and combining fragments that intersect each other in the space-filling curve.
