AN INVERTED LIST BASED APPROACH TO GENERATE OPTIMISED PATH IN DSR IN MANETS

Advancements of various Geographic Information Technologies have resulted in huge growth in Geo-Textual data. Many Indexing and searching algorithms are developed to handle this Geo-Textual data which contains spatial, textual and temporal information. In past, Indexing and searching algorithms are developed for the applications in which the object trajectory or velocity vector is known in advance and hence we can predict the future position of the objects. There are real time applications like emergency management systems, traffic monitoring, where the objects movements are unpredictable and hence future position of the objects cannot be predicted. Techniques are required to answer the geo-textual kNN query where the velocity vectors or trajectories of moving and moving queries are not known. In case of moving objects, capturing current position of the object and maintaining spatial index optimally is very much essential. The hybrid indexing techniques used earlier are based on R-tree spatial index. The nodes of the R-tree index structure are split or merged to maintain the locations of continuously moving objects, increasing the maintenance cost as compared to the grid index. In this paper a solution is proposed for creating and maintaining hybrid index for moving objects and queries based on grid and inverted list hybrid indexing techniques. The method is also proposed for finding Geo-Textual nearest neighbours for static and moving queries using hybrid index and conceptual partitioning of the grid. The overall gain reported by the experimental work using hybrid index over the non- hybrid index is 30 to 40 percent depending on the grid size chosen for mapping the data space and on the parameters of queries.

Download Full-text

A Hybrid Index Structure for Set-Valued Attributes Using Itemset Tree and Inverted List

Lecture Notes in Computer Science - Database and Expert Systems Applications ◽

10.1007/978-3-642-15364-8_30 ◽

2010 ◽

pp. 349-357 ◽

Cited By ~ 3

Author(s):

Shahriyar Hossain ◽

Hasan Jamil

Keyword(s):

Index Structure ◽

Hybrid Index ◽

Inverted List

Download Full-text

An Efficient and Effective Index Structure for Query Evaluation in Search Engines

Advances in Computer and Electrical Engineering - Advanced Methodologies and Technologies in Network Architecture, Mobile Computing, and Data Analytics ◽

10.4018/978-1-5225-7598-6.ch127 ◽

2019 ◽

pp. 1730-1743

Author(s):

Yangjun Chen

Keyword(s):

Search Engines ◽

Main Idea ◽

Effective Index ◽

Index Structure ◽

Query Evaluation ◽

Set Intersection ◽

Inverted List ◽

Interval Sequence

In this chapter, the authors discuss an efficient and effective index mechanism for search engines to support both conjunctive and disjunctive queries. The main idea behind it is to decompose an inverted list into a collection of disjoint sub-lists. The authors associate each word with an interval sequence, which is created by applying a kind of tree coding to a trie structure constructed over all the word sequences in a database. Then, attach each interval, instead of a word, with an inverted sub-list. In this way, both set intersection and union can be conducted by performing a series of simple interval containment checks. Experiments have been conducted, which shows that the new index is promising. Also, how to maintain indices, when inserting or deleting documents, is discussed in great detail.

Download Full-text

An Efficient and Effective Index Structure for Query Evaluation in Search Engines

Encyclopedia of Information Science and Technology, Fourth Edition ◽

10.4018/978-1-5225-2255-3.ch695 ◽

2018 ◽

pp. 7995-8005

Author(s):

Yangjun Chen

Keyword(s):

Search Engines ◽

Main Idea ◽

Effective Index ◽

Index Structure ◽

Query Evaluation ◽

Set Intersection ◽

Inverted List ◽

Interval Sequence

In this chapter, we discuss an efficient and effective index mechanism for search engines to support both conjunctive and disjunctive queries. The main idea behind it is to decompose an inverted list into a collection of disjoint sub-lists. We will associate each word with an interval sequence, which is created by applying a kind of tree coding to a trie structure constructed over all the word sequences in a database. Then, attach each interval, instead of a word, with an inverted sub-list. In this way, both set intersection and union can be conducted by performing a series of simple interval containment checks. Experiments have been conducted, which shows that the new index is promising. Also, how to maintain indexes, when inserting or deleting documents, is discussed in great detail.

Download Full-text

Efficient Inverted List Search Technique using Bitmap Filters

The KIPS Transactions PartD ◽

10.3745/kipstd.2011.18d.6.415 ◽

2011 ◽

Vol 18D (6) ◽

pp. 415-422

Author(s):

In-Teak Kwon ◽

Jong-Ik Kim

Keyword(s):

Search Technique ◽

Inverted List

Download Full-text

Design and Implementation of a Cache System in Web Search Engines

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.462-463.1106 ◽

2013 ◽

Vol 462-463 ◽

pp. 1106-1109

Author(s):

Hong Yuan Ma

Keyword(s):

Search Engine ◽

Search Engines ◽

Web Search ◽

Communication Architecture ◽

Design And Implementation ◽

Web Search Engine ◽

Inverted List ◽

Web Search Engines ◽

Application Processor ◽

Cache System

Web search engine caches the results which is frequently queried by users. It is an effective approach to improve the efficiency of Web search engines. In this paper, we give some valuable experience in our design and implementation of a Web search engine cache system. We present there design principles: logical layer processing, event-based communication architecture and avoiding frequent data copy. We also introduce the architecture presented in practice, including connection processor, application processor, query results caching processor, inverted list caching processor and list intersection caching processor. Experiments are conducted in our cache system using a real Web search engine query log.

Download Full-text