RISS 학술연구정보서비스

검색
다국어 입력

http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.

변환된 중국어를 복사하여 사용하시면 됩니다.

예시)
  • 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
  • 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
닫기
    인기검색어 순위 펼치기

    RISS 인기검색어

      KCI등재 SCIE SCOPUS

      A Mobile P2P Semantic Information Retrieval System with Effective Updates = A Mobile P2P Semantic Information Retrieval System with Effective Updates

      한글로보기

      https://www.riss.kr/link?id=A103352182

      • 0

        상세조회
      • 0

        다운로드
      서지정보 열기
      • 내보내기
      • 내책장담기
      • 공유하기
      • 오류접수

      부가정보

      다국어 초록 (Multilingual Abstract)

      As the technologies advance, mobile peer-to-peer (MP2P) networks or systems become one of the major ways to share resources and information. On such a system, the information retrieval (IR), including the development of scalable infrastructures for in...

      As the technologies advance, mobile peer-to-peer (MP2P) networks or systems become one of the major ways to share resources and information. On such a system, the information retrieval (IR), including the development of scalable infrastructures for indexing, becomes more complicated due to a huge increase on the amount of information and rapid information change. To keep the systems on MP2P networks more reliable and consistent, the index structures need to be updated frequently. For a semantic IR system, the index structure is even more complicated than a classic IR system and generally has higher update cost. The most well-known indexing technique used in semantic IR systems is Latent Semantic Indexing (LSI), of which the index structure is generated by singular value decomposition (SVD). Although LSI performs well, updating the index structure is not easy and time consuming. In an MP2P environment, which is fully distributed and dynamic, the update becomes more challenging. In this work, we consider how to update the sematic index generated by LSI and keep the index consistent in the whole MP2P network. The proposed Concept Space Update (CSU) protocol, based on distributed 2-Phase locking strategy, can effectively achieve the objectives in terms of two measurements: coverage speed and update cost. Using the proposed effective synchronization mechanism with the efficient updates on the SVD, re-computing the whole index on the P2P overlay can be avoided and the consistency can be achieved. Simulated experiments are also performed to validate our analysis on the proposed CSU protocol. The experimental results indicate that CSU is effective on updating the concept space with LSI/SVD index structure in MP2P semantic IR systems.

      더보기

      참고문헌 (Reference)

      1 G. Weikum, "Transactional information systems: theory, algorithms, and the practice of concurrency control and recovery" Morgan Kaufmann Publishers Inc 2001

      2 B. Y. Zhao, "Tapestry: A resilient global-scale overlay for service deployment" 22 : 41-53, 2004

      3 M. Berry, "Svdpackc user’s guide" Department of Computer Science, University of Tennessee 1993

      4 Y. Yang, "Semi-structured semantic overlay for information retrieval in self-organizing networks" 203-208, 2012

      5 I. Rudomilov, "Semantic p2p search engine" 991-995, 2011

      6 R. A Ferreira, "Semantic indexing in structured peer-to-peer networks" 68 (68): 64-77, 2008

      7 Y. Yang, "Semantic Information Retrieval over P2P Network" 391-396, 2011

      8 Y. K. Dalal, "Reverse path forwarding of broadcast packets" 21 : 1040-1048, 1978

      9 C. Tang, "Peer-to-peer information retrieval using self-organizing semantic overlay networks" 175-186, 2003

      10 A. Rowstron, "Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems" 329-350, 2001

      1 G. Weikum, "Transactional information systems: theory, algorithms, and the practice of concurrency control and recovery" Morgan Kaufmann Publishers Inc 2001

      2 B. Y. Zhao, "Tapestry: A resilient global-scale overlay for service deployment" 22 : 41-53, 2004

      3 M. Berry, "Svdpackc user’s guide" Department of Computer Science, University of Tennessee 1993

      4 Y. Yang, "Semi-structured semantic overlay for information retrieval in self-organizing networks" 203-208, 2012

      5 I. Rudomilov, "Semantic p2p search engine" 991-995, 2011

      6 R. A Ferreira, "Semantic indexing in structured peer-to-peer networks" 68 (68): 64-77, 2008

      7 Y. Yang, "Semantic Information Retrieval over P2P Network" 391-396, 2011

      8 Y. K. Dalal, "Reverse path forwarding of broadcast packets" 21 : 1040-1048, 1978

      9 C. Tang, "Peer-to-peer information retrieval using self-organizing semantic overlay networks" 175-186, 2003

      10 A. Rowstron, "Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems" 329-350, 2001

      11 H. Zha, "On updating problems in latent semantic indexing" 21 (21): 782-791, 1999

      12 S. Zhang, "On building and updating distributed LSI for P2P systems" 9-16, 2005

      13 P. Maymounkov, "Kademlia: A peer-to-peer information system based on the xor metric" 53-65, 2002

      14 S. Deerwester, "Indexing by latent semantic analysis" 41 : 391-407, 1990

      15 I. Hegedus, "Fully distributed robust singular value decomposition" 1-9, 2014

      16 E. Vecharynski, "Fast updating algorithms for latent semantic indexing" 35 (35): 1105-1131, 2014

      17 D. Zeinalipour-Yazti, "Exploiting locality for scalable information retrieval in peer-to-peer networks" 30 (30): 277-298, 2005

      18 A. Kontostathis, "Essential dimensions of latent semantic indexing (LSI)" 73-, 2007

      19 H. T. Shen, "Efficient semantic-based content search in P2P network" 16 (16): 813-826, 2004

      20 M. W. Berry, "Computational methods for intelligent information access" 20-, 1995

      21 I. Stoica, "Chord: a scalable peer-to-peer lookup protocol for internet applications" 11 (11): 17-32, 2003

      22 V. Mesaros, "A transactional system for structured overlay networks" Louvain-la-Neuve, BLN, FR 2005

      23 T. G. Kolda, "A semidiscrete matrix decomposition for latent semantic indexing information retrieval" 16 (16): 322-346, 1998

      24 Y. Chen, "A scalable semantic indexing framework for peer-to-peer information retrieval" 2005

      25 S. Ratnasamy, "A scalable content-addressable network" 161-172, 2001

      26 C. -C. Lai, "A novel mechanism to construct a compatible overlay on heterogeneous mobile peers" 78-83, 2013

      27 R. Schollmeier, "A definition of peer-to-peer networking for the classification of peer-to-peer architectures and applications" 101-, 2001

      더보기

      동일학술지(권/호) 다른 논문

      동일학술지 더보기

      더보기

      분석정보

      View

      상세정보조회

      0

      Usage

      원문다운로드

      0

      대출신청

      0

      복사신청

      0

      EDDS신청

      0

      동일 주제 내 활용도 TOP

      더보기

      주제

      연도별 연구동향

      연도별 활용동향

      연관논문

      연구자 네트워크맵

      공동연구자 (7)

      유사연구자 (20) 활용도상위20명

      인용정보 인용지수 설명보기

      학술지 이력

      학술지 이력
      연월일 이력구분 이력상세 등재구분
      학술지등록 한글명 : KSII Transactions on Internet and Information Systems
      외국어명 : KSII Transactions on Internet and Information Systems
      2023 평가예정 해외DB학술지평가 신청대상 (해외등재 학술지 평가)
      2020-01-01 평가 등재학술지 유지 (해외등재 학술지 평가) KCI등재
      2013-10-01 평가 등재학술지 선정 (기타) KCI등재
      2011-01-01 평가 등재후보학술지 유지 (기타) KCI등재후보
      2009-01-01 평가 SCOPUS 등재 (신규평가) KCI등재후보
      더보기

      학술지 인용정보

      학술지 인용정보
      기준연도 WOS-KCI 통합IF(2년) KCIF(2년) KCIF(3년)
      2016 0.45 0.21 0.37
      KCIF(4년) KCIF(5년) 중심성지수(3년) 즉시성지수
      0.32 0.29 0.244 0.03
      더보기

      이 자료와 함께 이용한 RISS 자료

      나만을 위한 추천자료

      해외이동버튼