2269 search results - page 213 / 454 » Query Incentive Networks |
172
Voted
ICDCS
2002
IEEE
15 years 11 months ago
2002
IEEE
Finding information in a peer-to-peer system currently requires either a costly and vulnerable central index, or flooding the network with queries. In this paper we introduce the...
164
click to vote
SIGMOD
2003
ACM
16 years 6 months ago
2003
ACM
Increasingly pervasive networks are leading towards a world where data is constantly in motion. In such a world, conventional techniques for query processing, which were developed...
255
click to vote
SIGMOD
2003
ACM
16 years 6 months ago
2003
ACM
Like HTML, many XML documents are resident on native file systems. Since XML data is irregular and verbose, the disk space and the network bandwidth are wasted. To overcome the ve...
165
click to vote
GLOBECOM
2007
IEEE
16 years 21 days ago
2007
IEEE
— Bloom filter is a space-efficient randomized data structure for group membership query. It is widely used in networking applications which involve the packet header/content i...
157
click to vote
ICDCSW
2006
IEEE
16 years 13 days ago
2006
IEEE
— Existing searching schemes in unstructured P2Ps can be categorized as either blind or informed. The quality of query results in blind schemes is low. Informed schemes use simpl...