2889 search results - page 337 / 578 » Querying Structured Hyperdocuments |
199
click to vote
INFOCOM
2006
IEEE
16 years 20 days ago
2006
IEEE
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
189
click to vote
BTW
2007
Springer
15 years 10 months ago
2007
Springer
: The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, has received increasing a...
246
click to vote
GBRPR
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. This paper proposes an expert peering system for information exchange. Our objective is to develop a real-time search engine for an online community where users can ask e...
196
click to vote
CIKM
2004
Springer
15 years 10 months ago
2004
Springer
With the tremendous growth of system memories, memoryresident databases are increasingly becoming important in various domains. Newer memories provide a structured way of storing ...
191
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Incorporating probabilities into the semantics of incomplete databases has posed many challenges, forcing systems to sacrifice modeling power, scalability, or treatment of relatio...