Design of a More Efficient and Effective Flip Flop use of K-Map Based Boolean Function
Journal: International Journal of Science and Research (IJSR) (Vol.5, No. 4)Publication Date: 2016-04-05
Authors : M. Valli; R. Periyasamy;
Page : 1675-1683
Keywords : Boolean Circuit; K Map; Flip flop; Gate; Algebra;
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.
Other Latest Articles
- The City in these Two Faces of Power: Study of Social Reality Actors in Ternate North Maluku, Indonesia
- Ectropion Post Ahmed's Glaucoma Valve Implantation: Case Report
- Effectiveness of Planned Teaching Programme on Knowledge Regarding Prevention of Vitamin A Deficiency among the Mothers of Under Five Children in Selected Rural Areas of Vidharbha Region
- Risk Factors: Pathogenesis, Diagnosis and Management of Delirium
- Prevalence of Yersinia enterocolitica in Locally Produced and Imported Veal Mincemeat in Baghdad
Last modified: 2021-07-01 14:33:56