Downloads: 116 | Views: 264

Research Paper | Computer Science & Engineering | India | Volume 5 Issue 4, April 2016 | Popularity: 6.8 / 10

Rate This Article!      

Design of a More Efficient and Effective Flip Flop use of K-Map Based Boolean Function

M. Valli, Dr. R. Periyasamy

Abstract: In this paper, we present a novel method to efficiently process SR flip flop spatial queries with conjunctive Boolean constraints on textual content. Our method combines an R-tree with an inverted index by the inclusion of spatial references in posting lists. The result is a disk resident, dual-index data structure that is used to proactively prune the search space. R-tree nodes are visited in best-first order. A node entry is placed in the priority queue if there exists at least one object that satisfies the Boolean condition in the sub tree pointed by the entry, otherwise, the Sub tree is not further explored. We show via extensive experimentation with real spatial databases that our method has increased performance over alternate techniques while scaling to large number of objects.

Keywords: Boolean Circuit, K Map, Flip flop, Gate, Algebra

Edition: Volume 5 Issue 4, April 2016

Pages: 1675 - 1683

DOI: https://www.doi.org/10.21275/NOV162979

Make Sure to Disable the Pop-Up Blocker of Web Browser

Click to Cite this Article

Similar Articles