A new approach on indexing mobile objects on the plane

Sioutas, Spyros; Tsakalidis, Konstantinos; Tsichlas, Kostas; Makris, Christos; Manolopoulos, Yannis

doi:10.1016/j.datak.2008.06.009

Cited by 7 publications

(3 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The Btree is an efficient index structure to speed up accessing data in various storage systems [1][2][3][4][5]. The B-tree helps to efficiently access the data according to its index structure and search algorithm.…”

Section: Problem Of the Index Structure On Nand Flash Memorymentioning

confidence: 99%

“…In order to address this problem, C. H. Wu and et al proposed BFTL [17] which is a software module for efficiently implementing a B-tree [1][2][3][4][5][6] on NAND flash memory. BFTL employs two main data structures the, reservation buffer and the node translation table to handle the intensive overwrite operations caused by record inserting, deleting, and B-tree reorganizing.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

An efficient index buffer management scheme for implementing a B-tree on NAND flash memory

Lee

2010

Data & Knowledge Engineering

View full text Add to dashboard Cite

Section: Problem Of the Index Structure On Nand Flash Memorymentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

An efficient index buffer management scheme for implementing a B-tree on NAND flash memory

Lee

2010

Data & Knowledge Engineering

View full text Add to dashboard Cite

“…Finally, in [27] a new access method (LBTs) was presented for indexing mobile objects that move on the plane to efficiently answer range queries about their future location. It has been proved that its update performance is the most efficient in all cases.…”

Section: A Literature Survey: the Most Basic Methods For Indexing Momentioning

confidence: 99%

Uncertainty for Privacy and 2-Dimensional Range Query Distortion

Sioutas

Magkos

Karydis

et al. 2011

Journal of Computing Science and Engineering

View full text Add to dashboard Cite

In this work, we study the problem of privacy-preservation data publishing in moving objects databases. In particular, the trajectory of a mobile user in a plane is no longer a polyline in a two-dimensional space, instead it is a two-dimensional surface of fixed width 2A defines the semi-diameter of the minimum spatial circular extent that must replace the real location of the mobile user on the XY-plane, in the anonymized (kNN) request. The desired anonymity is not achieved and the entire system becomes vulnerable to attackers, since a malicious attacker can observe that during the time, many of the neighbors' ids change, except for a small number of users. Thus, we reinforce the privacy model by clustering the mobile users according to their motion patterns in (u, θ) plane, where u and θ define the velocity measure and the motion direction (angle) respectively. In this case, the anonymized (kNN) request looks up neighbors, who belong to the same cluster with the mobile requester in (u, θ) space: Thus, we know that the trajectory of the k-anonymous mobile user is within this surface, but we do not know exactly where. We transform the surface's boundary poly-lines to dual points and we focus on the information distortion introduced by this space translation. We develop a set of efficient spatiotemporal access methods and we experimentally measure the impact of information distortion by comparing the performance results of the same spatiotemporal range queries executed on the original database and on the anonymized one. Category: Smart and intelligent computing

show abstract