Bookcover of Searching in non-overlapping Neighbor ranges on Plane Sweep Algorithm
Booktitle:

Searching in non-overlapping Neighbor ranges on Plane Sweep Algorithm

LAP LAMBERT Academic Publishing (2013-03-15 )

Books loader

Omni badge eligible for voucher
ISBN-13:

978-3-659-36723-6

ISBN-10:
3659367230
EAN:
9783659367236
Book language:
English
Blurb/Shorttext:
We have attempted to reduce the number of checked condition through saving frequency of the tandem replicated words, and also using non-overlapping iterative neighbor intervals on plane sweep algorithm. The essential idea of non-overlapping iterative neighbor search in a document lies in focusing the search not on the full space of solutions but on a smaller subspace considering non-overlapping intervals defined by the solutions. Subspace is defined by the range near the specified minimum keyword. We repeatedly pick a range up and flip the unsatisfied keywords, so the relevant ranges are detected. The proposed method tries to improve the plane sweep algorithm by efficiently calculating the minimal group of words and enumerating intervals in a document which contain the minimum frequency keyword. It decreases the number of comparison and creates the best state of optimized search algorithm especially in a high volume of data. Efficiency and reliability are also increased compared to the previous modes of the technical approach.
Publishing house:
LAP LAMBERT Academic Publishing
Website:
https://www.lap-publishing.com/
By (author) :
Elahe Moghimi Hanjani
Number of pages:
60
Published on:
2013-03-15
Stock:
Available
Category:
Other
Price:
35.90 €
Keywords:
text retrieval, Plane sweep algorithm, Replicated data, Partial search, Proximity search

Books loader

Newsletter

Adyen::amex Adyen::mc Adyen::visa Adyen::cup Adyen::unionpay Paypal CryptoWallet Wire Transfer

  0 products in the shopping cart
Edit cart
Loading frontend
LOADING