Abstract. Current XPath processors use direct approach to query evaluation which is quite inefficient in some cases and usually implemented serially. This may be a problem in case ...
Recently many data types arising from data mining and Web search applications can be modeled as bipartite graphs. Examples include queries and URLs in query logs, and authors and ...
— Search queries on biomedical databases, such as PubMed, often return a large number of results, only a small subset of which is relevant to the user. Ranking and categorization...
Current search technologies work in "one size fits all" fashion. Therefore, the answer to a query is independent of specific user information need. In this paper, we des...
Moving objects databases managing spatial objects with continuously changing position and extent over time have recently found large interest in the database community. Queries ab...