Taxonomy of broadcast indexing schemes for multi channel data dissemination in mobile databases

Waluyo, Agustinus Borgy; Srinivasan, Bala; Taniar, David

doi:10.1109/aina.2004.1283913

Cited by 35 publications

(19 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In our future research, we plan to extend our advanced range search approaches to continuous range search query processing as well as to the moving objects of interest [27][28][29] in mobile database [30][31][32][33] and parallel database environment [34,35]. And how these approaches can be applied in the intelligent traffic control system [36] and context-aware system [37] are also expected.…”

Section: Discussionmentioning

confidence: 99%

Constrained range search query processing on road networks

Xuan

Zhao

Taniar

et al. 2010

Concurrency and Computation

View full text Add to dashboard Cite

SUMMARYRange search is one of the most common queries in the spatial databases and geographic information systems (GIS). Most range search processing depends on the length of the distance that expresses the relative position of the objects of interest in the Euclidean space or road networks. But, in reality, the expected result is normally constrained by other factors (e.g. number of spatial objects, pre-defined area, and so forth.) rather than the distance alone; hence, range search should be comprehensively discussed in various scenarios. In this paper, we propose two constrained range search approaches based on network Voronoi diagram, namely Region Constrained Range (RCR) and k nearest neighbor Constrained Range (kCR), which make the range search query processing more flexible to satisfy different requirements in a complex environment. The performance of these approaches is analyzed and evaluated to illustrate that both of them can process constrained range search queries very efficiently.

show abstract

Section: Discussionmentioning

confidence: 99%

Constrained range search query processing on road networks

Xuan

Zhao

Taniar

et al. 2010

Concurrency and Computation

View full text Add to dashboard Cite

show abstract

“…In addition, it is also interesting to see how intelligence techniques may be in mobile navigation and mobile users [5,6], coupled with NVD to track moving users on the road network. It is expected that the efficient data broadcasting systems must be employed [22,23].…”

Section: Discussionmentioning

confidence: 99%

Voronoi-based reverse nearest neighbor query processing on spatial networks

2009

View full text Add to dashboard Cite

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.

show abstract

“…Other literature has proposed broadcasting schemes in multiple channel environments [38,40]. Their typical assumption is that each client is equipped with only one antennae (or one retrieving capability).…”

Section: Multiple Channel Schedulingmentioning

confidence: 99%

“…Figure 11 shows the Global index construction and restructuring process starting from the initial index tree. Notice from Figure 11 that the fifth leaf node (35,40,44) Figure 9 Post order traversal -Global index.…”

Section: Global Indexingmentioning

confidence: 99%

Mobile broadcast services with MIMO antennae in 4G wireless networks

et al. 2011

View full text Add to dashboard Cite

The deployment of wireless data broadcast to empower mobile information services as a resource-conserving means offers significant benefits due to the scalability feature offered by the technology. In this paper, we present a novel and holistic data broadcast management approach in 4 G wireless networks with multiple-input multipleoutput (MIMO) antennae. The proposed scheme consists of three elements, namely: (i) broadcast ordering; (ii) Global indexing; and (iii) merging data structure. With the integration of these elements, we expect to obtain substantial efficiency for mobile computing clients when retrieving data on-air. We have experimentally evaluated the performance of the proposed model including comparison with the relevant schemes. The results from the experiments affirm the effectiveness of our proposed approach in respect to minimizing query access time and conserving energy utilization of the clients.

show abstract

Taxonomy of broadcast indexing schemes for multi channel data dissemination in mobile databases

Cited by 35 publications

References 7 publications

Constrained range search query processing on road networks

Constrained range search query processing on road networks

Voronoi-based reverse nearest neighbor query processing on spatial networks

Mobile broadcast services with MIMO antennae in 4G wireless networks

Contact Info

Product

Resources

About