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
Author(s):  
Vikas Goel ◽  
Anil Kumar Ahlawat ◽  
M N Gupta

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.


2013 ◽  
Vol 284-287 ◽  
pp. 3428-3432 ◽  
Author(s):  
Yu Hsiu Huang ◽  
Richard Chun Hung Lin ◽  
Ying Chih Lin ◽  
Cheng Yi Lin

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.


2012 ◽  
Vol 02 (04) ◽  
pp. 106-109 ◽  
Author(s):  
Rujia Gao ◽  
Danying Li ◽  
Wanlong Li ◽  
Yaze Dong

Author(s):  
Namik Delilovic

Searching for contents in present digital libraries is still very primitive; most websites provide a search field where users can enter information such as book title, author name, or terms they expect to be found in the book. Some platforms provide advanced search options, which allow the users to narrow the search results by specific parameters such as year, author name, publisher, and similar. Currently, when users find a book which might be of interest to them, this search process ends; only a full-text search or references at the end of the book may provide some additional pointers. In this chapter, the author is going to give an example of how a user could permanently get recommendations for additional contents even while reading the article, using present machine learning and artificial intelligence techniques.


Sign in / Sign up

Export Citation Format

Share Document