Dict-Based Energy and Latency Efficient Air Indexing Technique for Full Text Search Over Wireless Broadcast Stream

2016 ◽  
Vol 7 (4) ◽  
pp. 50-72
Author(s):  
Vikas Goel ◽  
Anil Kumar Ahlawat ◽  
M N Gupta
Keyword(s):  
Full Text ◽  
Service Providers ◽  
Access Time ◽  
Data Broadcasting ◽  
Wireless Data ◽  
Text Search ◽  
Full Text Search ◽  
Wireless Broadcast ◽  
Wireless Data Broadcasting ◽  
Indexing Technique

Wireless data broadcasting seems to be an efficient way for dissemination of data to a large number of mobile users. Because of its scalability and flexibility, the service providers use this technology to resolve request of thousands of users in one single response. Full text search is the latest area of research in wireless data broadcasting. Access time and tuning time are the two metrics for evaluation of an indexing technique. In this paper, we propose an air indexing technique based on the dictionary data structure namely Dict-Based Air Indexing Technique for full text search over wireless broadcast stream that utilizes hash-tables. We also propose algorithms for the implementation of the technique. We analyze, evaluate and compare its performance with existing schemes. The results from simulation experiments demonstrate that the proposed technique is the most latency and energy efficient air indexing technique for full text searches.

Indexing and Clustering of Wireless Broadcast Data

2011 ◽  
pp. 60-95
Author(s):  
Yon Dohn Chung ◽  
Myoung Ho Kim
Keyword(s):  
Data Management ◽  
Energy Efficient ◽  
Broadcast Channel ◽  
Data Broadcasting ◽  
Wireless Data ◽  
Data Indexing ◽  
Wireless Broadcast ◽  
Wireless Data Broadcasting ◽  
Mobile Clients ◽  
Management Issues

This chapter describes some data management issues that are necessary for wireless data broadcasting. The major topics we include in this chapter are (a) broadcast data indexing and (b) broadcast data clustering. Mobile clients can access the wireless data in an energy-efficient way with the index on the broadcast channel, and the well-clustered broadcast data enables mobile clients to access the wireless data in a short latency.

scholarly journals NN Search based on Non-uniform Space Partition on Air

2021 ◽  
Vol 12 (5) ◽  
pp. 317-325
Author(s):  
Seokjin Im
Keyword(s):  
Uniform Space ◽  
Wireless Channel ◽  
Access Time ◽  
Query Point ◽  
Data Broadcasting ◽  
Wireless Data ◽  
Tuning Time ◽  
Space Partition ◽  
Wireless Data Broadcasting ◽  
Spatial Partition

It is one of most important challenges in information services based on location to support a huge number of clients to process the NN query for a given query point. A scheme of NN query processing based on wireless data broadcasting is an effective way to overcome the challenge. In this paper, we propose an indexing scheme NSPI (Non-uniform Space Partition Index) for quick NN search over wireless data broadcasting. For implementing the aim, we use a non-uniform spatial partition and provide an index based on the partition for equidistance between indexes on the wireless channel. The index scheme enables the clients to process NN quickly by lessening the time for the clients to meet the index on the channel. To show the effectiveness of the proposed scheme, we compare the access time and tuning time of the clients with existing indexing schemes by simulation studies. The proposed NSPI shows shorter access time than the other existing scheme. Also, NSPI outperforms in the aspect of tuning time than the others.

scholarly journals Partial index replicated and distributed scheme for full-text search on wireless broadcast

Sadhana ◽  
2015 ◽  
Vol 40 (7) ◽  
pp. 2129-2142 ◽  
Author(s):  
VIKAS GOEL ◽  
ANIL KUMAR AHLAWAT ◽  
M N GUPTA
Keyword(s):  
Full Text ◽  
Partial Index ◽  
Text Search ◽  
Full Text Search ◽  
Wireless Broadcast ◽  
Distributed Scheme

GPU Computation for Online Realtime Multi-Pattern Matching

2013 ◽  
Vol 284-287 ◽  
pp. 3428-3432 ◽  
Author(s):  
Yu Hsiu Huang ◽  
Richard Chun Hung Lin ◽  
Ying Chih Lin ◽  
Cheng Yi Lin
Keyword(s):  
Parallel Computation ◽  
Pattern Matching ◽  
Full Text ◽  
Network Performance ◽  
Text Search ◽  
Full Text Search ◽  
Network Intrusion ◽  
Speed Up ◽  
Set Up ◽  
Gpu Implementation

Most applications of traditional full-text search, e.g., webpage search, are offline which exploit text search engine to preview the texts and set up related index. However, applications of online realtime full-text search, e.g., network Intrusion detection and prevention systems (IDPS) are too hard to implementation by using commodity hardware. They are expensive and inflexible for more and more occurrences of new virus patterns and the text cannot be previewed and the search must be complete realtime online. Additionally, IDPS needs multi-pattern matching, and then malicious packets can be removed immediately from normal ones without degrading the network performance. Considering the problem of realtime multi-pattern matching, we implement two sequential algorithms, Wu-Manber and Aho-Corasick, respectively over GPU parallel computation platform. Both pattern matching algorithms are quite suitable for the cases with a large amount of patterns. In addition, they are also easier extendable over GPU parallel computation platform to satisfy realtime requirement. Our experimental results show that the throughput of GPU implementation is about five to seven times faster than CPU. Therefore, pattern matching over GPU offers an attractive solution of IDPS to speed up malicious packets detection among the normal traffic by considering the lower cost, easy expansion and better performance.

scholarly journals Application of Full Text Search Engine Based on Lucene

2012 ◽  
Vol 02 (04) ◽  
pp. 106-109 ◽  
Author(s):  
Rujia Gao ◽  
Danying Li ◽  
Wanlong Li ◽  
Yaze Dong
Keyword(s):  
Search Engine ◽  
Full Text ◽  
Text Search ◽  
Full Text Search
Sign in / Sign up

Export Citation Format

Share Document