2121 search results - page 365 / 425 » Indexing Incomplete Databases |
208
click to vote
ICDE
2007
IEEE
16 years 3 months ago
2007
IEEE
A k-nearest neighbor (k-NN) query retrieves k objects from a database that are considered to be the closest to a given query point. Numerous techniques have been proposed in the p...
221
Voted
ICDE
2006
IEEE
16 years 3 months ago
2006
IEEE
Counting in general, and estimating the cardinality of (multi-) sets in particular, is highly desirable for a large variety of applications, representing a foundational block for ...
211
Voted
VLDB
2008
ACM
16 years 2 months ago
2008
ACM
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous e...
220
click to vote
SIGMOD
2008
ACM
16 years 2 months ago
2008
ACM
As peer-to-peer (P2P) networks become more familiar to the database community, intense interest has built up in using their scalability and resilience properties to scale database...
137
click to vote
SIGMOD
2003
ACM
16 years 2 months ago
2003
ACM
Most relational query optimizers make use of information about the costs of accessing tuples and data structures on various storage devices. This information can at times be off b...