2223 search results - page 176 / 445 » Query Optimization in an OODBMS |
172
click to vote
CLEF
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Recent research has suggested that there is no general similarity measure, which can be applied on arbitrary databases without any parameterization. Hence, the optimal co...
141
click to vote
ICTIR
2009
Springer
15 years 1 months ago
2009
Springer
Abstract. A useful ability for search engines is to be able to rank objects with novelty and diversity: the top k documents retrieved should cover possible interpretations of a que...
163
click to vote
ESA
2011
Springer
14 years 3 months ago
2011
Springer
Abstract. In this paper we address the problem of building a compressed self-index that, given a distribution for the pattern queries and a bound on the space occupancy, minimizes ...
205
click to vote
SIGMOD
2005
ACM
16 years 4 months ago
2005
ACM
Relational DBMS typically execute concurrent queries independently by invoking a set of operator instances for each query. To exploit common data retrievals and computation in con...
126
click to vote
PODS
2006
ACM
16 years 4 months ago
2006
ACM
Query containment is a fundamental algorithmic problem in database query processing and optimization. Under set semantics, the query-containment problem for conjunctive queries ha...