作者: C. Schmidt , M. Parashar
DOI: 10.1109/HPDC.2003.1210032
关键词: Distributed database 、 Grid computing 、 Information discovery 、 Multidimensional systems 、 Theoretical computer science 、 Computer science 、 Search engine indexing 、 Information space 、 Shared resource 、 Resource allocation 、 Distributed computing
摘要: The ability to efficiently discover information using partial knowledge (for example keywords, attributes or ranges) is important in large, decentralized, resource sharing distributed environments such as computational grids and peer-to-peer (P2P) storage retrieval systems. This paper presents a P2P discovery system that supports flexible queries keywords wildcards, range queries. It guarantees all existing data elements match query are found with bounded costs terms of number messages peers involved. key innovation dimension reducing indexing scheme effectively maps the multidimensional space physical peers. design, implementation experimental evaluation presented.