CN102541922B - A kind of method of the double-color reverse nearest query based on uncertain data collection and device - Google Patents
A kind of method of the double-color reverse nearest query based on uncertain data collection and device Download PDFInfo
- Publication number
- CN102541922B CN102541922B CN201010613841.1A CN201010613841A CN102541922B CN 102541922 B CN102541922 B CN 102541922B CN 201010613841 A CN201010613841 A CN 201010613841A CN 102541922 B CN102541922 B CN 102541922B
- Authority
- CN
- China
- Prior art keywords
- query object
- anonymous
- alternative
- aoi
- point
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention provides the method for the double-color reverse nearest query based on uncertain data collection, comprise step: a. determines the AOI of query object, wherein, described query object is for first kind node; B. the anonymous frame of common factor is had to be defined as alternative anonymous frame by with described AOI; C. result set is generated according to alternative anonymous frame.Corresponding device is also provided.Reverse nearest neighbor querying method based on uncertain data collection provided by the invention, when suitably two dimension is anonymous for user data, the RNN of a q is determined in inquiry.Utilize VC (q), draw AOI MBR, then inquire about the user anonymity region in this MBR, the common factor of calculated candidate region and V DEG C (q) becomes the possibility of RNN (q), calculates RNN (q) with this.The present invention completes the RNN inquiry on double-colored uncertain data collection; Anonymous way discrete and continuous two kinds of modes have been extended to from discrete.
Description
Technical field
The present invention relates to space-time database (Spatio-Temporal DataBase, STDB) position-based service (Location-based Database in, LBS) technical field of information inquiry, specifically query point position is determined, be queried a position uncertain time, solve the method for the Reverse nearest neighbor of query point.
Background technology
Space-time database started to be subject to people's attention in late 1980s, had now become the direction, forward position received much concern in database field.Spatiotemporal data warehouse is as space-time database basic operation, research contents is quite abundant, relate generally to K-NN search (Nearest-Neighbor Queries), range query (Range Queries), continuous-query (Continuous Queries) etc.Reverse nearest neighbor inquiry (Reverse Nearest-NeighborQueries) is the extension of K-NN search, and its result of calculation take set point as the Data Node of arest neighbors.Reverse nearest neighbor inquiry (RNN) is widely used field, such as business decision, documentation management, Geographic Information System etc.
Current Reverse nearest neighbor inquiry is mainly divided into two large classes: monochromatic (monochromatic) Reverse nearest neighbor inquiry and the inquiry of double-colored (bichromatic) Reverse nearest neighbor.In monochromatic Reverse nearest neighbor inquiry, all query point a little belong to one species S with being queried.Therefore, a data object r is considered to the Reverse nearest neighbor of query object q, and the distance that and if only if between data centralization arbitrary object p and q is greater than the distance of r and q.That is:
a, B 2 class point is had in double-colored K-NN search.Wherein query point belongs to category-A point, and is queried and a little belongs to category-B point.A data object r is considered to the Reverse nearest neighbor of query object q, and the distance in and if only if category-B object between arbitrary object p and q is greater than the distance between r and q, namely
Double-color reverse arest neighbors generally involves a data structure, Voronoi Cell by name (that is: VC, dimension network promise unit).VC is the elementary cell of Voronoi Diagram.The VC (i.e. VC (q)) of set point q is the unique convex polygon set up according to given two-dimentional point set S.The distance being arranged in the inner point of VC (q) and q in this two-dimensional spaces all be all less than a little with S except q the distance of other any points.
In space-time database, conventional index structure is R-Tree and derivative various tree structure on its basis.R-Tree is a kind of height balanced tree being similar to B-Tree, realizes complete dynamic index, does not need artificial timing to upgrade.The index structure that the present invention uses is R-Tree.
While people enjoy various location-based service, the privacy threats that personnel location information is revealed also becomes a serious problem gradually, causes the attention of researchers.Location privacy refer to prevent other people from knowing by any way object is gone over, present position.For protection customer location privacy, customer position information needs the space of different situations anonymous usually, makes assailant can not obtain the more specific location information of user.The method of customer position information space anonymity is roughly divided into two kinds, i.e. discrete anonymity and continuously anonymity.Namely discrete anonymity represents the real exact position of user with an area of space, in the region user several point respectively with different probability occur, all probabilities of occurrence and be 1; Continuous anonymity refers to that the probability that each position occurs in anonymous region is identical.
Muhammad in 2009 Reverse nearest neighbor possibility proposed based on uncertain data collection in TKDE publishes an article Probabilistic ReverseNearest Neighbor Queries onUncertain Data is inquired about, and the method achieves the uncertain Reverse nearest neighbor inquiry of monochrome in discrete anonymous situation.Figuratively understand the application scenarios of uncertain RNN inquiry in literary composition, and propose multiple R-Tree (R type tree) Pruning strategy.The scene problem of discrete anonymity under the inquiry of this space-time data Reverse nearest neighbor and the current state-of-the-art achievement in research of uncertain data collection crossing domain only address only monochromatic RNN, can not solve the problem that RNN under monochrome, the scene such as double-colored and discrete, continuous inquires about.
Summary of the invention
For defect of the prior art, the object of this invention is to provide a kind of method of the double-color reverse nearest query based on uncertain data collection and corresponding device.
According to an aspect of the present invention, provide the method for the double-color reverse nearest query based on uncertain data collection, comprise step: a. determines the AOI of query object, wherein, described query object is for first kind node; B. the anonymous frame of common factor is had to be defined as alternative anonymous frame by with described AOI; C. result set is generated according to alternative anonymous frame.
According to another aspect of the present invention, also provide the device of the double-color reverse nearest query based on uncertain data collection, comprise device: the first determining device, it is for determining the AOI of query object, and wherein, described query object is for first kind node; Second determining device, it is for having the anonymous frame of common factor to be defined as alternative anonymous frame by with described AOI; First generating apparatus, it is for generating result set according to alternative anonymous frame.
Address only monochromatic RNN inquire about application in discrete anonymity to overcome prior art, the invention provides the method that double-colored RNN in a little discrete, the continuous anonymous situation of being queried inquires about.
The technical solution adopted for the present invention to solve the technical problems is in conjunction with VC, according to the possibility (ρ) being queried the part of the anonymous region of object in VC and being called query point RNN, judges to be queried the RNN whether region is query point.The invention has the beneficial effects as follows, higher precision ratio and time efficiency can be reached, and threshold value ρ can be set flexibly, obtain Query Result according to different possibilities.
Compared with background technology, the present invention has following advantage:
(1) the RNN inquiry on double-colored uncertain data collection, is completed;
(2), anonymous way discrete and continuous two kinds of modes have been extended to from discrete.
Accompanying drawing explanation
By reading the detailed description done non-limiting example with reference to the following drawings, other features, objects and advantages of the present invention will become more obvious:
Fig. 1 illustrates according to the first embodiment of the present invention, based on the process flow diagram of the method for the double-color reverse nearest query of uncertain data collection;
Fig. 2 illustrates according to a second embodiment of the present invention, based on the process flow diagram of the method for the double-color reverse nearest query of uncertain data collection;
According to the third embodiment of the invention Fig. 3 illustrates, based on the structural drawing of the device of the double-color reverse nearest query of uncertain data collection;
According to the third embodiment of the invention Fig. 4 illustrates, based on the schematic diagram of the method for the double-color reverse nearest query of uncertain data collection; And
According to the third embodiment of the invention Fig. 5 illustrates, based on the schematic diagram of the method for the double-color reverse nearest query of uncertain data collection.
Embodiment
With reference to figure 1, Fig. 2, the invention provides a kind of double-colored reverse nearest neighbor queries algorithm based on uncertain data collection (Bichromatic Reverse Nearest-Neighbors queriesbased on Uncertain Dataset, B-RNNUD).It is based on uncertain data collection; the anonymity a little done to a certain extent will be queried; in order to protect user profile; and set up voronoi cell and VC (q) and MBR thereof with the similar node of query point q; convenient filter the MBRi being queried object, after filtering and VC have the MBRi of common factor will be calculated as the possibility ρ i of the RNN into q, if ρ i is greater than given threshold ρ; then include result set in, otherwise abandon.This algorithm is mainly used in the Reverse nearest neighbor inquiry under the prerequisite of the protection customer location privacies such as strategic decision system.
Fig. 1 illustrates according to the first embodiment of the present invention, based on the process flow diagram of the method for the double-color reverse nearest query of uncertain data collection.Particularly, in the present embodiment, first perform step S210, determine the AOI of query object, wherein, described query object is for first kind node.Then perform step S211, have the anonymous frame of common factor to be defined as alternative anonymous frame by with described AOI.Finally perform step S212, generate result set according to alternative anonymous frame.
Fig. 2 illustrates according to a second embodiment of the present invention, based on the process flow diagram of the method for the double-color reverse nearest query of uncertain data collection.Particularly, in the present embodiment, first perform step S220, determine the Voronoi Cell of described query object.Then perform step S221, determine described AOI according to described Voronoi Cell.Then perform step S222, the R-Tree of traversal Equations of The Second Kind node, inquiry and described AOI have the anonymous frame of common factor.Then perform step S223, calculate alternative anonymous frame described in each and the ratio of described Voronoi Cell intersection area with its total area successively, and be the first ratio by outcome record.Then perform step S224, judge whether described first ratio is greater than first threshold.Further, if the judged result of described step S224 is affirmative, that is, then next enters step S225 and continue to perform; If the judged result of described step S224 is negative, that is, then process ends.Finally perform step S225, include the described alternative anonymous frame corresponding with described first ratio in described result set.
In a preference of the present embodiment, described step S220 comprises step and " travels through the R-Tree of described first kind node, inquire about several arest neighbors nodes of described query object ", step is " with described query object for starting point, straight up for direction vector is set up in direction, rotate in the counterclockwise direction, often scan the arest neighbors node of a described query object, just draw the perpendicular bisector between described query object and arest neighbors node ", and step " run-down in the end scans between a described arest neighbors node and first described arest neighbors node again, determine described Voronoi Cell ".
In another preference of the present embodiment, described step S221 comprises step, and " find out the point that in the dimension all summits of network promise unit, ordinate is minimum respectively, the point that ordinate is maximum, the point that horizontal ordinate is minimum, the point that horizontal ordinate is maximum, is set to H1, H2, W1, W2 respectively; With through H1, H2 and be parallel to x-axis two straight lines and through W1, W2 and the rectangle that surrounds of two straight lines being parallel to y-axis as the minimum boundary rectangle of this dimension network promise unit, i.e. MBR (VC (q)) ".
In a change case of the present embodiment, described step S223 can be changed to step " calculate the possibility sum that alternative anonymous frame described in each and described Voronoi Cell intersection internal discrete point become RNN (q) successively; and by outcome record be first and value ", correspondingly, described step S224 is changed to step and " judges whether described first be greater than Second Threshold with value ", and described step S225 is changed to step and " includes the described alternative anonymous frame corresponding with described first and value in described result set ".
According to the third embodiment of the invention Fig. 3 illustrates, based on the structural drawing of the device of the double-color reverse nearest query of uncertain data collection.Particularly, in the present embodiment, described control device 4 comprises the first determining device 41, and it is for determining the AOI of query object, and wherein, described query object is for first kind node; Second determining device 42, it is for having the anonymous frame of common factor to be defined as alternative anonymous frame by with described AOI; First generating apparatus 43, it is for generating result set according to alternative anonymous frame.
Preferably, described first determining device 41 comprises the 3rd determining device 411, and it is for determining the Voronoi Cell of described query object; 4th determining device 412, it is for determining described AOI according to described Voronoi Cell.
Preferably, described second determining device 42 comprises the 4th treating apparatus 421, and it is for traveling through the R-Tree of Equations of The Second Kind node, and inquiry and described AOI have the anonymous frame of common factor.
Preferably, described first generating apparatus 43 comprises the 5th treating apparatus 431, and outcome record for calculating alternative anonymous frame described in each and the ratio of described Voronoi Cell intersection area with its total area successively, and is the first ratio by it; First judgment means 432, it is for judging described in each, whether the first ratio is greater than first threshold; 6th treating apparatus 433, it, for when described first ratio is greater than first threshold, includes the described alternative anonymous frame corresponding with described first ratio in described result set.
In a preference of the present embodiment, described 3rd determining device 411 comprises the first treating apparatus, and it inquires about several arest neighbors nodes of described query object for traveling through the R-Tree of described first kind node; Second treating apparatus, its for described query object for starting point, straight up for direction vector is set up in direction, rotate in the counterclockwise direction, often scan the arest neighbors node of a described query object, just draw the perpendicular bisector between described query object and arest neighbors node; 3rd treating apparatus, it in the end scans between a described arest neighbors node and first described arest neighbors node for run-down again, determines described Voronoi Cell.
In another preference of the present embodiment, the particular content that described 4th determining device 412 comprises device is: find out the point that in the dimension all summits of network promise unit, ordinate is minimum respectively, the point that ordinate is maximum, the point that horizontal ordinate is minimum, the point that horizontal ordinate is maximum, is set to H1 respectively, H2, W1, W2; With through H1, H2 and be parallel to x-axis two straight lines and through W1, W2 and the rectangle that surrounds of two straight lines being parallel to y-axis as the minimum boundary rectangle of this dimension network promise unit, i.e. MBR (VC (q)).
In a change case of the present embodiment, described 5th treating apparatus 431 can be changed to the 7th treating apparatus, it becomes the possibility sum of RNN (q) for calculating alternative anonymous frame described in each and described Voronoi Cell intersection internal discrete point successively, and is first and value by outcome record; Correspondingly, described first judgment means 432 can be changed to the second judgment means, its for judge described in each first and value whether be greater than Second Threshold, described 6th treating apparatus 433 is changed to the 8th treating apparatus, its for when described first and value be greater than Second Threshold time, include described result set in by with described first and the corresponding described alternative anonymous frame of value.
Further, according to the third embodiment of the invention Fig. 4 and Fig. 5 illustrate jointly, based on the schematic diagram of the method for the double-color reverse nearest query of uncertain data collection.It will be appreciated by those skilled in the art that preferably, the technical solution adopted for the present invention to solve the technical problems is: a kind of Reverse nearest neighbor querying method based on uncertain data collection.When suitably two dimension is anonymous for user data, the RNN of a q is determined in inquiry.Utilize VC (q), draw AOI MBR, then inquire about the user anonymity region in this MBR, the common factor of calculated candidate region and VC (q) becomes the possibility of RNN (q), calculates RNN (q) with this.Composition graphs 4, embodiment illustrated in fig. 5, its concrete grammar is described below:
The first step: the R type tree of traversal index category-A node, k the arest neighbors (front k the category-A point that namely distance q point is nearest, nearest neighbors are called for short NN) of inquiry q;
Second step: take q as starting point, straight up for direction vector is set up in direction, rotate in the counterclockwise direction, often scans the kNN (being set to a pi) of a q, just draws the perpendicular bisector between q and pi.Run-down in the end scans between pn and first p0 again, determines dimension network promise unit VC (q) of final q point, the quadrilateral that namely in Fig. 4,11,12,13,14 4 straight lines are determined;
3rd step: the minimum boundary rectangle MBR (VC (q)) calculating the dimension network promise unit of q, i.e. dashed rectangle in Fig. 5;
4th step: the R type tree of traversal category-B object, inquiry and MBR (VC (q)) have the anonymous frame R0 of common factor ..., Rm, the R0 namely in Fig. 5 ..., R7;
5th step: calculate R0 successively ..., the ratio (anonymous continuously) of Rm and VC (q) intersection area and its total area, or intersection internal discrete point becomes the possibility sum of RNN (q), record result ρ i ';
6th step: ρ i ' and the threshold value ρ set before are compared, the situation higher than ρ includes result set in, otherwise abandons, and algorithm terminates.
Above specific embodiments of the invention are described.It is to be appreciated that the present invention is not limited to above-mentioned particular implementation, those skilled in the art can make various distortion or amendment within the scope of the claims, and this does not affect flesh and blood of the present invention.
Claims (2)
1. based on a method for the double-color reverse nearest query of uncertain data collection, it is characterized in that, comprising:
A. determine the AOI of query object, wherein, described query object, for first kind node, comprising:
A1. determine the dimension network promise unit of described query object, comprising:
A11. travel through the R type tree of first kind node described in index, inquire about several arest neighbors nodes of described query object;
A12. with described query object for starting point, straight up for direction vector is set up in direction, rotate in the counterclockwise direction, often scan the arest neighbors node of a described query object, just draw the perpendicular bisector between described query object and arest neighbors node;
A13. run-down in the end scans between a described arest neighbors node and first described arest neighbors node again, determines described dimension network promise unit;
A2. determine described AOI according to described dimension network promise unit, comprising:
A11 '. find out the point that in the dimension all summits of network promise unit, ordinate is minimum respectively, the point that ordinate is maximum, the point that horizontal ordinate is minimum, the point that horizontal ordinate is maximum, is set to H1, H2, W1, W2 respectively;
A12 '. with through H1, H2 and be parallel to x-axis two straight lines and through W1, W2 and the rectangle that surrounds of two straight lines being parallel to y-axis as the minimum boundary rectangle of this dimension network promise unit, i.e. described AOI MBR (VC (q));
B. there is the anonymous frame of common factor to be defined as alternative anonymous frame by with described AOI, comprising:
B1. travel through the R type tree of Equations of The Second Kind node, inquiry and described AOI have the anonymous frame of common factor;
C. generate result set according to described alternative anonymous frame, comprising:
C1. calculate alternative anonymous frame described in each and the ratio of described dimension network promise unit intersection area with its total area successively, and be the first ratio by outcome record;
C2. judge described in each, whether the first ratio is greater than first threshold;
If c3. described first ratio is greater than first threshold, then include the described alternative anonymous frame corresponding with described first ratio in described result set;
Or comprise:
C1 '. calculate the possibility sum that alternative anonymous frame described in each and described dimension network promise unit intersection internal discrete point become Reverse nearest neighbor RNN (q) of query object q successively, and be first and value by outcome record;
C2 '. to judge described in each first and value whether be greater than Second Threshold;
C3 ' if. described first and value be greater than Second Threshold, then include described result set in by with described first and the corresponding described alternative anonymous frame of value.
2. based on a device for the double-color reverse nearest query of uncertain data collection, it is characterized in that, comprise as lower device:
First determining device, it is for determining the AOI of query object, and wherein, described query object, for first kind node, comprising:
3rd determining device, it, for determining the dimension network promise unit of described query object, comprising:
First treating apparatus, it, for traveling through the R type tree of described first kind node, inquires about several arest neighbors nodes of described query object;
Second treating apparatus, its for described query object for starting point, straight up for direction vector is set up in direction, rotate in the counterclockwise direction, often scan the arest neighbors node of a described query object, just draw the perpendicular bisector between described query object and arest neighbors node;
3rd treating apparatus, it in the end scans between a described arest neighbors node and first described arest neighbors node for run-down again, determines described dimension network promise unit;
4th determining device, it, for determining described AOI according to described dimension network promise unit, comprising:
Search device, it is for finding out the point that in the dimension all summits of network promise unit, ordinate is minimum respectively, the point that ordinate is maximum, the point that horizontal ordinate is minimum, and the point that horizontal ordinate is maximum, is set to H1, H2, W1, W2 respectively;
Rectangle determining device, it is for through H1, H2 and be parallel to x-axis two straight lines and through W1, W2 and the rectangle that surrounds of two straight lines being parallel to y-axis as the minimum boundary rectangle of this dimension network promise unit, i.e. described AOI MBR (VC (q));
Second determining device, it, for having the anonymous frame of common factor to be defined as alternative anonymous frame by with described AOI, comprising:
4th treating apparatus, it is for traveling through the R type tree of Equations of The Second Kind node, and inquiry and described AOI have the anonymous frame of common factor; First generating apparatus, it, for generating result set according to described alternative anonymous frame, comprising:
5th treating apparatus, outcome record for calculating alternative anonymous frame described in each and the ratio of described dimension network promise unit intersection area with its total area successively, and is the first ratio by it;
First judgment means, it is for judging described in each, whether the first ratio is greater than first threshold;
6th treating apparatus, it, for when described first ratio is greater than first threshold, includes the described alternative anonymous frame corresponding with described first ratio in described result set;
Or comprise:
7th treating apparatus, it becomes the possibility sum of Reverse nearest neighbor RNN (q) of query object q for calculating alternative anonymous frame described in each and described dimension network promise unit intersection internal discrete point successively, and is first and value by outcome record;
Second judgment means, its for judge described in each first and value whether be greater than Second Threshold;
8th treating apparatus, its for when described first and value be greater than Second Threshold time, include described result set in by with described first and the corresponding described alternative anonymous frame of value.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010613841.1A CN102541922B (en) | 2010-12-24 | 2010-12-24 | A kind of method of the double-color reverse nearest query based on uncertain data collection and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010613841.1A CN102541922B (en) | 2010-12-24 | 2010-12-24 | A kind of method of the double-color reverse nearest query based on uncertain data collection and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102541922A CN102541922A (en) | 2012-07-04 |
| CN102541922B true CN102541922B (en) | 2015-09-16 |
Family
ID=46348838
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201010613841.1A Active CN102541922B (en) | 2010-12-24 | 2010-12-24 | A kind of method of the double-color reverse nearest query based on uncertain data collection and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102541922B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102831162B (en) * | 2012-07-18 | 2015-08-26 | 中山大学 | A kind of maximum double-colored reverse nearest neighbor queries method |
| CN102968475B (en) * | 2012-11-16 | 2015-05-20 | 上海交通大学 | Secure nearest neighbor query method and system based on minimum redundant data partition |
| CN103778196B (en) * | 2014-01-07 | 2017-01-18 | 浙江大学 | Optical location method based on double-color reverse nearest neighbor query |
| CN104750860B (en) * | 2015-04-16 | 2017-11-10 | 东北大学 | A kind of date storage method of uncertain data |
| CN105005609B (en) * | 2015-07-08 | 2018-03-13 | 华东师范大学 | The computational methods for the optimized scope position enquiring that distance sensitive can vary in size |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1953442A (en) * | 2006-09-14 | 2007-04-25 | 浙江大学 | Method of k-neighbour query based on data mesh |
| CN101866353A (en) * | 2010-06-09 | 2010-10-20 | 孟小峰 | Privacy continuous-query protection method based on location-based service |
-
2010
- 2010-12-24 CN CN201010613841.1A patent/CN102541922B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1953442A (en) * | 2006-09-14 | 2007-04-25 | 浙江大学 | Method of k-neighbour query based on data mesh |
| CN101866353A (en) * | 2010-06-09 | 2010-10-20 | 孟小峰 | Privacy continuous-query protection method based on location-based service |
Non-Patent Citations (2)
| Title |
|---|
| Probabilistic Reverse Nearest Neighbor Queries on Uncertain Data;Muhammad Aamir Cheema;《IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING》;20100430;第22卷(第4期);550-562 * |
| 空间网络数据库中反K最近邻查询算法;朱彩云;《小型微型计算机系统》;20090930;第30卷(第9期);1781-1785 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102541922A (en) | 2012-07-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102541922B (en) | A kind of method of the double-color reverse nearest query based on uncertain data collection and device | |
| Vlachou et al. | SKYPEER: Efficient subspace skyline computation over distributed data | |
| Li et al. | An improved PSO algorithm for distributed localization in wireless sensor networks | |
| CN103853769A (en) | Method and device for processing map query request | |
| CN106992991A (en) | The adjustable k anonymous locations method for secret protection of dynamic in a kind of VANET | |
| CN104346444A (en) | Optimum site selection method based on road network reverse spatial keyword query | |
| Shim et al. | Nearest close friend search in geo-social networks | |
| Zhou et al. | Design of v-type warehouse layout and picking path model based on internet of things | |
| US20220027427A1 (en) | Business searching methods and apparatuses, electronic devices and storage media | |
| Wang et al. | $ N $-in-One: A Novel Location-Based Service | |
| Rodríguez-Mazahua et al. | Horizontal partitioning of multimedia databases using hierarchical agglomerative clustering | |
| Oh et al. | An efficient processing of range spatial keyword queries over moving objects | |
| Yi et al. | View field nearest neighbor: A novel type of spatial queries | |
| CN101917475B (en) | P2P (Peer-to-Peer) mode based PSRD (Program Support Requirements Document) universal service resource discovery method | |
| Aggarwal et al. | Spatio-temporal frequent itemset mining on web data | |
| John et al. | Dynamic sorting and average skyline method for query processing in spatial-temporal data | |
| Zhang et al. | A hybrid index model for efficient spatio-temporal search in HBase | |
| Qiao et al. | Privacy-preserving skyline queries in LBS | |
| Lim et al. | An efficient method for processing reverse skyline queries | |
| CN108304449B (en) | Big data Top-k query method based on self-adaptive data set partitioning mode | |
| Tang et al. | Supporting continuous skyline queries in dynamically weighted road networks | |
| CN109446294B (en) | Parallel mutual subspace Skyline query method | |
| Chatzimilioudis et al. | Crowdsourcing emergency data in non-operational cellular networks | |
| Lee et al. | An efficient spatio-temporal index for spatio-temporal query in wireless sensor networks | |
| Kun-Lun et al. | Obstructed nearest neighbor query under uncertainty in the internet of things environment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20200309 Address after: 364000 area a, floor 4, building 3, science and Technology Pioneer Park, No.15 Qutan Road, Dongxiao Town, Xinluo District, Longyan City, Fujian Province Patentee after: Longyan YuanSpectrum Photoelectric Technology Co., Ltd. Address before: 200241 No. 500, Dongchuan Road, Shanghai, Minhang District Patentee before: EAST CHINA NORMAL University |
|
| TR01 | Transfer of patent right |