1860 search results - page 182 / 372 » A Model of Queries for Object-Oriented Databases |
245
Voted
SIGMOD
2006
ACM
16 years 4 months ago
2006
ACM
This paper introduces the Tuple Graph (TuG) synopses, a new class of data summaries that enable accurate selectivity estimates for complex relational queries. The proposed summari...
134
click to vote
SIGMOD
2008
ACM
15 years 4 months ago
2008
ACM
The presence of encyclopedic Web sources, such as Wikipedia, the Internet Movie Database (IMDB), World Factbook, etc. calls for new querying techniques that are simple and yet mor...
200
click to vote
JMLR
2012
13 years 7 months ago
2012
Given a point set S and an unknown metric d on S, we study the problem of efficiently partitioning S into k clusters while querying few distances between the points. In our model...
137
click to vote
VLDB
2007
ACM
15 years 10 months ago
2007
ACM
The general problem of answering top-k queries can be modeled using lists of data items sorted by their local scores. The most efficient algorithm proposed so far for answering to...
149
click to vote
TKDE
2011
14 years 11 months ago
2011
— 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...