Unlock instant, AI-driven research and patent intelligence for your innovation.

Distributed in-memory spatial data store for k-nearest neighbour search

A data storage and space technology, applied in the management of taxi services, can solve problems such as unacceptable delay

Pending Publication Date: 2021-12-17
GRABTAXI HOLDINGS PTE LTD
View PDF5 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Therefore, answering the K nearest search requires scanning all keys, and its delay is unacceptable

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Distributed in-memory spatial data store for k-nearest neighbour search
  • Distributed in-memory spatial data store for k-nearest neighbour search
  • Distributed in-memory spatial data store for k-nearest neighbour search

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0053] As used in this document, a "database" is a structure with an operating and management system that includes memory and is configured to store data into memory for easy search storage data in memory.

[0054] A database can be viewed as having a number of logical rows and a number of logical columns, each logical row representing an object and each logical column representing an attribute of an object. In this context, a "tuple" is a single row representing the set of attributes of a particular object.

[0055] "Hashing" is converting a string of characters into a data item called a "key", which represents the original string. Hashes are used for indexing and retrieving items in databases because looking up items with shorter hash keys is faster than using raw values.

[0056] "Consistent Hashing" is a distributed hashing scheme that operates independently of nodes or objects in a distributed hash table by assigning positions on an abstract circle or hash ring. or the...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

A database system is configured to enable fast searching for neighbours nearest to a mobile object located in a geographical space made up of plural spatially distinct subspaces, each being made up of plural cells. The database system has an operating system controlling storage of object data amongst the plural storage nodes, to represent one or more spatially distinct subspaces, in a respective single one of the storage nodes. Location data of each object is used to index that object with respect to cells making up each spatially distinct subspace in each node.

Description

technical field [0001] The present invention relates generally to data storage and retrieval. More particularly but not exclusively, the present invention relates to database systems for facilitating K-Nearest Neighbor searches. Exemplary embodiments are in the field of managing ride-hailing services. Background technique [0002] In a typical taxi-hailing scenario, a potential user makes a booking request through a smartphone app, and the host completes the request by dispatching the most suitable available service provider nearby to provide the desired service. [0003] Locating the nearest moving objects (e.g., drivers) in real time is one of the fundamental problems to be solved for ride-hailing services. The host tracks the real-time geographic location of the service providers and searches for K available service providers near the user's location for each booking request, since the closest service provider may not always be the best choice. To simplify matters, str...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): G08G1/00G06Q10/08
CPCG08G1/205G06Q10/02G06Q30/0202G06Q10/08G06Q10/0631G06F16/29G06Q50/40G06Q10/047G06Q10/08355G06F16/90335
Inventor 张志印黄晓骋孙超堂郑少麟
Owner GRABTAXI HOLDINGS PTE LTD