ABSTRACT
This chapter explores data structures for point search queries and widely used data structures to answer some very important queries. It discusses disjoint-set data structure which is well known for its applications in network algorithms and provides find set queries. The chapter examines binomial heaps and Fibonacci heaps; both are known for their roles in creating priority queues and proposes various kinds of strings and their variants that are designed for membership queries. It argues that the use of inverted indices for handling keyword queries. The disjoint-set data structure is characterized by its unique operations and provides the way to understand the data which is always arranged as a disjoint collection of sets. In link-list representation of a disjoint set, the makeset and findset perform in constant time whereas the union is almost linear. The point of using an index is to increase the speed and efficiency of searches of the document collection.
