Efficient Search Technique for Special Database

Provided by: Creative Commons
Topic: Data Management
Format: PDF
Conventional special queries, like retrieval of nearest place, involve solely on the conditions based on objects' geometric characteristics. Now-a-days, several fashionable applications require novel kinds of queries that seek out objects that satisfy each of a special predicate, and their associated texts. An example is that, rather than taking into account all of the restaurants, a nearest place question would instead provoke the building that is the nearest among those, whose menu items contain \"Steak, spaghetti and brandy\" all at identical time. Currently the most effective resolution to these types of queries is predicated on the IR2-tree, which encompasses quite some disadvantages.

Find By Topic