3686 search results - page 439 / 738 » Indexing relations on the web |
308
click to vote
SIGMOD
2009
ACM
16 years 7 months ago
2009
ACM
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
161
click to vote
ASPLOS
2010
ACM
16 years 1 months ago
2010
ACM
Debugging concurrent programs is difficult. This is primarily because the inherent non-determinism that arises because of scheduler interleavings makes it hard to easily reproduc...
194
click to vote
VLDB
2004
ACM
16 years 3 days ago
2004
ACM
It is well established that bitmap indices are efficient for read-only attributes with low attribute cardinalities. For an attribute with a high cardinality, the size of the bitma...
206
click to vote
SIGCOMM
2003
ACM
16 years 20 hour ago
2003
ACM
Content-based full-text search is a challenging problem in Peer-toPeer (P2P) systems. Traditional approaches have either been centralized or use flooding to ensure accuracy of th...
187
click to vote
FOCS
2000
IEEE
15 years 11 months ago
2000
IEEE
There is an upsurging interest in designing succinct data structures for basic searching problems (see [23] and references therein). The motivation has to be found in the exponent...