Correction to: AnonSURP: an anonymous and secure ultralightweight RFID protocol for deployment in internet of vehicles systems

The Journal of Supercomputing -     

Voronoi-based reverse nearest neighbor query processing on spatial networks

The use of Voronoi diagram has traditionally been applied to computational geometry and multimedia problems. In this paper, we will show how Voronoi diagram can be applied to spatial query processing, and in particular to Reverse Nearest Neighbor (RNN) queries. Spatial and geographical query processing, in general, and RNN in particular, are becoming more important, as online maps are now widely available. In this paper, using the concept of Voronoi diagram, we classify RNN into four types depending on whether the query point and the interest objects are the generator points of the Voronoi Polygon or not. Our approach is based on manipulating Network Voronoi Diagram properties and applying a progressive incremental network expansion for finding the polygon inner network distances required to solve RNN queries. Our experimentation results show that our approaches have good response times in answering RNN queries.     

A Taxonomy of Indexing Schemes for Parallel Database Systems

In this paper, we present a taxonomy of indexing schemes in parallel database systems. Index partitioning is not recognized widely as yet. One of the reasons is that most of index structures are trees, not flat structures like tables, and consequently, index partitioning imposes some degree of complexity compared with common data partitioning for tables. We present three parallel indexing schemes, and discuss their maintenance strategies. We also analyze their storage requirements.     

IG-Tree: an efficient spatial keyword index for planning best path queries on road networks

World Wide Web - Due to the popularity of Spatial Databases, many search engine providers have started to expand their text searching capability to include geographical information. Because of this...     

Voronoi-based range and continuous range query processing in mobile databases

With the wide availability of mobile devices (smart phones, iPhones, etc.), mobile location-based queries are increasingly in demand. One of the most frequent queries is range search which returns objects of interest within a pre-defined area. Most of the existing methods are based on the road network expansion method – expanding all nodes (intersections and objects) and computing the distance of each node to the query point. Since road networks are extremely complex, node expansion approaches are inefficient. In this paper, we propose a method, Voronoi Range Search (VRS) based on the Voronoi diagram, to process range search queries efficiently and accurately by partitioning the road networks to some special polygons. Then we further propose Voronoi Continuous Range (VCR) to satisfy the requirement for continuous range search queries (moving queries) based on VRS. Our empirical experiments show that VRS and VCR surpass all their rivals for both static and moving queries.     

Reverse Approximate Nearest Neighbor Queries on Road Network

World Wide Web - Reverse k Nearest Neighbor (RkNN) queries retrieve all objects that consider the query as one of their k most influential objects. Given a set of user U, a set of facilities F and...     

AnonSURP: an anonymous and secure ultralightweight RFID protocol for deployment in internet of vehicles systems

The Journal of Supercomputing - With the rapid development in world-wide technologies affecting large-scale applications, the Internet of Things (IoT) has gained a lot of attention from such...     

Partitioning methods for multi-version XML data warehouses

Due to an explosive increase of XML documents, it is imperative to manage XML data in an XML data warehouse. XML warehousing imposes challenges, which are not found in the relational data warehouses. In this paper, we firstly present a framework to build an XML data warehouse schema. For the purpose of scalability due to the increase of data volume, we propose a number of partitioning techniques for multi-version XML data warehouses, including document based partitioning, schema based partitioning, and cascaded (mixed) partitioning model. Finally, we formulate cost models to evaluate various types of queries for an XML data warehouse.     

A connectivity index for moving objects in an indoor cellular space

With the currently available indoor positioning devices such as RFID, Bluetooth and WI-FI, the locations of moving objects constitute an important foundation for a variety of applications such as the tracking of moving objects, security and way finding. Many studies have proven that most individuals spend their lives in indoor environments. Therefore, in this paper, we propose a new index structure for moving objects in cellular space. The index is based on the connectivity (adjacency) between the indoor environment cells and can effectively respond to the spatial indoor queries and enable efficient updates of the location of a moving object in indoor space. An empirical performance study suggests that the proposed indoor-tree in terms of measurements and performance is effective, efficient and robust.