RISS 학술연구정보서비스

검색
다국어 입력

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

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

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

    RISS 인기검색어

      검색결과 좁혀 보기

      선택해제

      오늘 본 자료

      • 오늘 본 자료가 없습니다.
      더보기
      • 무료
      • 기관 내 무료
      • 유료
      • Query Evaluation on Probabilistic Databases Using Indexing and MapReduce

        Kavita K. Beldar,M. D. Gayakwad,Debnath Bhattacharyya,Hye-jin Kim 보안공학연구지원센터 2016 International Journal of Database Theory and Appli Vol.9 No.10

        Entity resolution technique is used for recognize the duplicate tuples which signify similar real world entities. Existing resolution technique is unable to solve the problems of higher level of heterogeneity and additional continual data alteration. Working on this type of database, there is necessitated to enumerate the integrity of data. The new approach is introduced here on probabilistic databases by unmerged duplicates for processing complex queries. This is achieved by using probabilistic databases. For competent access toward entity resolution data over a large collection of possible resolution worlds, new indexing technique is presented here. Also, a computation of query processing is reduced by using indexing structure. The focus is on set similarity relation on very big probabilistic database by using MapReduce technique. MapReduce is a popular paradigm that can process large volume data more efficiently. In this paper, different approaches proposed using MapReduce to deal with this task: 1. merge data set with MapReduce and merge data set without MapReduce, 2. Merge data set with MapReduce using Hadoop. This approaches implemented on windows and Hadoop framework and performed compressing experiments to their performances. Also the speedup ratio for both is tested.

      • A Comparative Analysis on Contingence Structured Data Methodologies

        Kavita K. Beldar,M. D. Gayakwad,Debnath Bhattacharyya,Tai-hoon Kim 보안공학연구지원센터 2016 International Journal of Software Engineering and Vol.10 No.5

        Heterogeneous structured datas give rise to different kind of information caliber issues regarding real-world structured datas. Identical records also a one major issue. Strategy to eliminate identical records results in unsureness to select among true uniform records. Available methods based on expert observation and destructive decisions do not proved effective solution to such problems. This project solves these issues of identical records elimination will solve by de-duplication procedure as data accessing tasks with unsure outcomes. This project implements method to overcome unsureness of identical records that tightly conceal the proper instances of input and gives effective results for identical record.

      연관 검색어 추천

      이 검색어로 많이 본 자료

      활용도 높은 자료

      해외이동버튼