• Title/Summary/Keyword: 데이타 베이스. 인터넷

Search Result 160, Processing Time 0.029 seconds

XPOS: XPath-based OWL Storage Model for Effective Query Processing (XPOS: 효율적인 질의 처리를 위한 XPath 기반의 OWL 저장 모델)

  • Kim, Jin-Hyung;Jeong, Dong-Won;Baik, Doo-Kwon
    • Journal of KIISE:Databases
    • /
    • v.35 no.3
    • /
    • pp.243-256
    • /
    • 2008
  • With rapid growth of Internet, the amount of information in the Web is increasing exponentially. However, information on the current Web is understandable only for human, and thus it makes the exact information retrieval difficult. For solving this problem, the Semantic Web is suggested and we must use ontology languages that can endow data to semantics for implementing it. One of the representative ontology languages is OWL(Web Ontology Language) adopted as a recommendation by the World-Wide Web Consortium. OWL has richer expression power and formal semantics than other ontology languages such as RDF and RDF-S. In addition, OWL includes hierarchical structure information between classes or properties. Therefore, an efficient OWL storage model considering hierarchical structure for effective information retrieval on the Semantic Web is required. In this paper, we suggest the XPOS(XPath-based OWL Storage) model including hierarchy information between classes or properties as XPath form and enabling intuitive and effective information retrieval. Also, we show the comparative evaluation results on the performance of XPOS model, Sesame, and the XML storage-based storage model regarding query processing.

Web-based Image Retrieval and Classification System using Sketch Query (스케치 질의를 통한 웹기반 영상 검색과 분류 시스템)

  • 이상봉;고병철;변혜란
    • Journal of KIISE:Software and Applications
    • /
    • v.30 no.7_8
    • /
    • pp.703-712
    • /
    • 2003
  • With the explosive growth n the numbers and sizes of imaging technologies, Content-Based Image Retrieval (CBIR) has been attacked the interests of researchers in the fields of digital libraries, image processing, and database systems. In general, in the case of query-by-image, in user has to select an image from database to query, even though it is not his completely desired one. However, since query-by-sketch approach draws a query shape according to the user´s desire it can provide more high-level searching interface to the user compared to the query-b-image. As a result, query-by-sketch has been widely used. In this paper, we propose a Java-based image retrieval system that consists of sketch query and image classification. We use two features such as color histogram and Haar wavelets coefficients to search similar images. Then the Leave-One-Out method is used to classify database images. The categories of classification are photo & painting, city & nature, and sub-classification of nature image. By using the sketch query and image classification, w can offer convenient image retrieval interface to user and we can also reduce the searching time.

Design and Implementation of a Geographic Database for Sightseeing Information Using an Object-Relational DBMS (객체-관계 DBMS를 이용한 관광안내 지리정보 데이터베이스 설계 및 구현)

  • 김영란;최은선
    • Journal of the Korea Society of Computer and Information
    • /
    • v.4 no.4
    • /
    • pp.47-56
    • /
    • 1999
  • We design and implement an ORDBMS-based geographic information system for sightseeing information of Chungbuk to verify the performance and applicability of GEUS/XTM ORDBMS. We Acquire the positional coordinates of the boundaries of administrative districts , roads, and railroads, determine the various kinds of information such as the locations of sightseeing sites, lodgings, and so on, design an object-relational schema using OMT, and implement the geographic information system including a database system. Through the examination of selective accessibility on the sightseeing inform ation database by the various queries, we conclude that the ORDBMS is more applicable than other DBMSs in modeling, storing, referring, and managing of non-fixed complex data such as sightseeing information. Therefore, ORDBMSs provide efficient and extensible implementations of databases and information services from various sources for the increasing demand on geographic information service on internet.

  • PDF

Web-based Medical Information System supporting DICOM Specification (DICOM 표준을 지원하는 웹 기반 의료 정보 시스템)

  • Kwon, Gi-Beom;Kim, Il-Kon
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.7 no.4
    • /
    • pp.317-323
    • /
    • 2001
  • DICOM(Digital Imaging and Communications in MediCine), standard of medical image operation, present the methods for communications and Storage of Medical Image. medical image acquired from patient in hospital made DICOM files. this paper purposes design and implementation methodologies of a web-based medical information system that consists of DICOM (Digital Imaging and Communications in Medicine) databases and functional components of a web server in order to support the access of medical information with Intemet web browser. we store the patient and image information to database using reading the group and element oJ DICOM file. we made file transfer module by implementing DICOM Store service, in result, we can transfer DICOM file to IF based host or computer. We compose web component of communications and Storage service, user be used DICOM Service by web Browser.

  • PDF

Temporal Interval Refinement for Point-of-Interest Recommendation (장소 추천을 위한 방문 간격 보정)

  • Kim, Minseok;Lee, Jae-Gil
    • Database Research
    • /
    • v.34 no.3
    • /
    • pp.86-98
    • /
    • 2018
  • Point-of-Interest(POI) recommendation systems suggest the most interesting POIs to users considering the current location and time. With the rapid development of smartphones, internet-of-things, and location-based social networks, it has become feasible to accumulate huge amounts of user POI visits. Therefore, instant recommendation of interesting POIs at a given time is being widely recognized as important. To increase the performance of POI recommendation systems, several studies extracting users' POI sequential preference from POI check-in data, which is intended for implicit feedback, have been suggested. However, when constructing a model utilizing sequential preference, the model encounters possibility of data distortion because of a low number of observed check-ins which is attributed to intensified data sparsity. This paper suggests refinement of temporal intervals based on data confidence. When building a POI recommendation system using temporal intervals to model the POI sequential preference of users, our methodology reduces potential data distortion in the dataset and thus increases the performance of the recommendation system. We verify our model's effectiveness through the evaluation with the Foursquare and Gowalla dataset.

Cost-based Optimization of Composite Web Service Executions Using Intensional Results (내포 결과를 이용한 복합 웹 서비스 실행의 비용 기반 최적화)

  • Park, Chang-Sup
    • Journal of KIISE:Databases
    • /
    • v.33 no.7
    • /
    • pp.715-726
    • /
    • 2006
  • Web service technologies provide a standard means for interoperation and integration of heterogeneous applications distributed over the Internet. For efficient execution of hierarchically interacting composite web services, this paper proposes an approach to distribute web service invocations over peer systems effectively, exploiting intensional XML data embedding external service calls as a result of well services. A cost-based optimization problem on the execution of web services using intensional results was formalized, and a heuristic search method to find an optimal solution and a greedy algorithm to generate an efficient invocation plan quickly were suggested in this paper. Experimental evaluation shows that the proposed greedy algorithm provides near-optimal solutions in an acceptable time even for a large number of Web services.

Video Retrieval System supporting Adaptive Streaming Service (적응형 스트리밍 서비스를 지원하는 비디오 검색 시스템)

  • 이윤채;전형수;장옥배
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.9 no.1
    • /
    • pp.1-12
    • /
    • 2003
  • Recently, many researches into distributed processing on Internet, and multimedia data processing have been performed. Rapid and convenient multimedia services supplied with high quality and high speed are to be needed. In this paper, we design and implement clip-based video retrieval system on the Web enviroment in real-time. Our system consists of the content-based indexing system supporting convenient services for video content providers, and the Web-based retrieval system in order to make it easy and various information retrieval for users in the Web. Three important methods are used in the content-based indexing system, key frame extracting method by dividing video data, clip file creation method by clustering related information, and video database construction method by using clip unit. In Web-based retrieval system, retrieval method ny using a key word, two dimension browsing method of key frame, and real-time display method of the clip are used. In this paper, we design and implement the system that supports real-time display method of the clip are used. In this paper, we design and implement the system that supports real-time retrieval for video clips on Web environment and provides the multimedia service in stability. The proposed methods show a usefulness of video content providing, and provide an easy method for serching intented video content.

A Filtering Technique of Streaming XML Data based Postfix Sharing for Partial matching Path Queries (부분매칭 경로질의를 위한 포스트픽스 공유에 기반한 스트리밍 XML 데이타 필터링 기법)

  • Park Seog;Kim Young-Soo
    • Journal of KIISE:Databases
    • /
    • v.33 no.1
    • /
    • pp.138-149
    • /
    • 2006
  • As the environment with sensor network and ubiquitous computing is emerged, there are many demands of handling continuous, fast data such as streaming data. As work about streaming data has begun, work about management of streaming data in Publish-Subscribe system is started. The recent emergence of XML as a standard for information exchange on Internet has led to more interest in Publish - Subscribe system. A filtering technique of streaming XML data in the existing Publish- Subscribe system is using some schemes based on automata and YFilter, which is one of filtering techniques, is very popular. YFilter exploits commonality among path queries by sharing the common prefixes of the paths so that they are processed at most one and that is using the top-down approach. However, because partial matching path queries interrupt the common prefix sharing and don't calculate from root, throughput of YFilter decreases. So we use sharing of commonality among path queries with the common postfixes of the paths and use the bottom-up approach instead of the top-down approach. This filtering technique is called as PoSFilter. And we verify this technique through comparing with YFilter about throughput.

The Design & Implementation of Korean Information Retrieval System (ETLARS) (한글정보검색시스템(ETLARS)의 설계 및 구현)

  • Hong, G.C.;KIM, S.D.;Park, G.S.;Kim, H.S.;Cheong, H.S.;Choi, Y.G.;Woo, D.J.
    • Electronics and Telecommunications Trends
    • /
    • v.10 no.2 s.36
    • /
    • pp.1-24
    • /
    • 1995
  • 본 논문은 정보화 시대에 있어서 요구되는 정보의 내용이 다양해지고 각 전문 분야별 정보의 내용이 많아짐에 따라 이용자들에게 필요한 정보를 더욱 편리하고 간단한 방법으로 제공할 수 있도록 하기 위한 정보 통신 분야의 한글 정보 검색시스템 (ETLARS)의 설계 및 구현에 관한 내용을 서술하고자 한다. 특히 구현된 본 시스템은 현재 국내의 정보검색 분야에 있어서 아직까지는 이렇다할 시스템이 없는 시점에서 전자 통신 분야의 전문 정보를 수록한 한글 데이타베이스를 구축하여 통신 유관 기관을 포함한 전국의 불특정 다수에게 하이텔 및 인터넷 서비스를하고 있는 중이며, 이러한 전문정보외에도 이미지, 음성 등 멀티미디어 정보의 추가 및 유저 인터페이스의 향상 등 계속적인 시스템 보완을 통해서 이용자들의 요구조건을 충족시켜 줄 수 있는 시스템으로 발전해 나갈 계획이다.

A Study on the use of WWW search engines of librarians for the internet information retrieval (사서들의 효율적인 인터넷 정보검색을 위한 WWW 탐색엔진 이용에 관한 연구)

  • 김성희
    • The Journal of Information Technology and Database
    • /
    • v.6 no.1
    • /
    • pp.27-46
    • /
    • 1999
  • This study was intended to find the use patterns of internet search engines of librarians and to measure the relationship between internet use frequency and the use behavior of internet search engines. The results showed that librarians use Web search engines for academic information retrieval and are satisfied with the search results. The major problems when librarians use search engines were that search engines retrieve many non-relevant documents. As a result of hypotheses test, the relationship between internet frequency and the preference of search engines was not significantly different. On the other hand, the hypotheses that internet frequency affects satisfaction of search results, recognition of importance of search engines, and the need of retraining of librarians for internet information retrieval were shown to be significant.

  • PDF