Current search engines cannot effectively rank those relational data, which exists on dynamic websites supported by online databases. In this study, to rank such structured data, ...
-- In this paper, we put forward our approach for answering aggregated queries over imprecise data using domain specific taxonomies. A new concept we call the weighted hierarchical...
In this paper we focus on the following problem in information management: given a large collection of recorded information and some knowledge of the process that is generating th...
Given a set of Datalog rules, facts, and a query, answers to the query can be inferred bottom-up starting with the facts or top-down starting with the query. For efficiently answe...
In a range-aggegate query problem we wish to preprocess a set S of geometric objects such that given a query orthogonal range q, a certain intersection or proximity query on the o...