Istituto di Scienza e Tecnologie dell'Informazione     
Lee W., Jianliang X., Jianzhong L., Silvestri F. Special Section: Scalable information systems. In: Future Generation Computer Systems. Editorial, vol. 25 (1) pp. 51 - 52. Elsevier, 2009.
As data and knowledge volumes keep increasing, and global means for information dissemination continues to diversify, new methods, modeling paradigms and structures are needed to effi- ciently support the mounting scalability requirements for the large variety of current and future data, information, and knowledge [1-3]. Grid computing, peer-to-peer technology, data and knowl- edge bases, distributed information retrieval technology, and net- working technology should all converge to address the scalability concern. This special section compiles recent work on addressing scalability issues of distributed and peer-to-peer systems. Selected papers from the Second International Conference on Scalable In- formation Systems (INFOSCALE 2007) were invited for extension and submission to this special section. Finally, five papers were in- cluded in this special section. The first paper entitled ''OntoZilla: An Ontology-based, Semi- structured, and Evolutionary Peer-to-Peer Network for Informa- tion Systems and Services'' [4] presents a system called OntoZilla that combines ontology and P2P systems. In OntoZilla, peers sup- porting the same concept are grouped into the same cluster, and the relationships between clusters are modeled according to the concepts they specialize in. Thus, a query belonging to a specific concept can be efficiently routed to the suitable group of peers. The second paper entitled ''Distance Browsing in Distributed Multimedia Databases'' [5] proposes a Distributed Incremental Nearest Neighbor algorithm (DINN) for finding closest objects in an incremental fashion over data distributed on networked computer nodes. The authors prove that the proposed algorithm is optimum with respect to both the number of nodes involved and the number of local-INN invocations. The third paper entitled ''An Efficient Peer-to-Peer Indexing Tree Structure for Multidimensional Data'' [6] proposes SDI (Swift tree structure for multidimensional Data Indexing), a swift index scheme with simple tree structure for multidimensional data indexing in large-scale distributed systems. While keeping the query efficiency in O(logN) in terms of routing hops, SDI has extremely low maintenance cost which is proved through theoretical analysis. The fourth paper entitled ''Query-Driven Indexing for Scalable Peer-to-Peer Text Retrieval'' [7] presents a query-driven index- ing/retrieval strategy for efficient full text retrieval from large doc- ument collections distributed within a structured P2P network. The authors show that the index size and the generated index- ing/retrieval traffic remains manageable even for Web-size docu- ment collections at the price of a marginal loss in precision for rare queries. The fifth paper entitled ''Contention-Based Performance Eval- uation of Multidimensional Range Search in Peer-to-peer Net- works'' [8] is concerned with contention-based performance evaluation of P2P search techniques. The authors evaluate P2P net- works derived from recently proposed studies in terms of two new metrics related to concurrency and contention, namely responsive- ness and throughput, and reveal some interesting results.
URL: http://scienceserver.cilea.it/cgi-bin/sciserv.pl?collection=journals&journal=0167739x&issue=v25i0001
DOI: http://dx.doi.org/10.1016/j.future.2008.07.012
Subject Scalable information systems

Icona documento 1) Download Document PDF

Icona documento Open access Icona documento Restricted Icona documento Private


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional