• Title/Summary/Keyword: Web Query

Search Result 545, Processing Time 0.028 seconds

An Optimization Technique based on Signatures for OWL Query Processing (OWL 질의 처리를 위한 시그너처 기반 최적화 기법)

  • Im Donghyuk;Jeong Hoyoung;Kim Hyoung-Joo
    • Journal of KIISE:Databases
    • /
    • v.32 no.6
    • /
    • pp.585-592
    • /
    • 2005
  • The Semantic Web is being studied as the next step in the evolution of the web. In the environment of the Semantic Web, the information must be understandable computers as well as a just human. So we use ontologies for describing the contents of the web resources. Among such ontologies, OWL is proposed as a recommendation by W3C. OWL data is represented as graph structure and the query is evaluated by traversing each node of the graph. In this paper, we propose the optimization technique based on signature to efficiently process the OWL data. Our approach minimizes traversing each node of the graph in query processing.

Information Seeking Behavior of the NAVER Users via Query Log Analysis (질의 로그 분석을 통한 네이버 이용자의 검색 형태 연구)

  • Lee, Joon-Ho;Park, So-Yeon;Kwon, Hyuk-Sung
    • Journal of the Korean Society for information Management
    • /
    • v.20 no.2
    • /
    • pp.27-41
    • /
    • 2003
  • Query logs are online records that capture user interactions with information retrieval systems and all the search processes. Query log analysis offers ad advantage of providing reasonable and unobtrusive means of collecting search information from a large number of users. In this paper, query logs of NAVER, a major Korean Internet search service, were analyzed to investigate the information seeking behabior of NAVER users. The query logs were collected over one week from various collecions such as comprehensive search, directory search and web ducument searc. It is expected that this study could contribute to the development and implementation of more effective web search systems and services.

Ontology Version Control for Web Document Search (웹문서 검색을 위한 온톨로지 버전 제어)

  • Kim, Byung Gon
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.9 no.3
    • /
    • pp.39-48
    • /
    • 2013
  • Ontology has an important role in semantic web to construct and query semantic data. When system make changes to ontologies, questions arise about versioning of these changes. Applying this changes on a dynamic environment is even more important. To apply these changes, change specification method is needed. Early studies show RDF-based syntax for the operations between old and new ontologies. When several ontology versions can be used for some query, if possible, using possible newest version ontology with prospective use is best way to process the query. Prospective use of ontology means using a newer version of an ontology with a data source that conforms to a more recent ontology. In this paper, for prospective use of ontology version, structure of change specification of class and property through several ontology versions is proposed. From this, efficient adaptive ontology version selection for a query can be possible. Algorithm for structure of version transition representation is proposed and simulation results show possible newest version number for queries.

Analyzing of Hangul Search Query Spelling Error Patterns and Developing Query Spelling Correction System Based on User Logs (한글 검색 질의어 오타 패턴 분석과 사용자 로그를 이용한 질의어 오타 교정 시스템 구축)

  • Jeon, Hee-Won;Huang, Daniel;Rim, Hae-Chang
    • Annual Conference on Human and Language Technology
    • /
    • 2010.10a
    • /
    • pp.15-21
    • /
    • 2010
  • 본 논문은 검색 서비스 기능 중에 빼놓을 수 없는 기능인 한글 검색 질의어(query) 교정 시스템을 '야후!'에서 구축하며 분석한 한글 오타 패턴 그리고 사용자 로그를 기반으로 설계한 질의어 교정 서비스에 대한 설명을 하고 있다. 이 교정 서비스는 현재 '야후! 코리아'에 적용되어 있으며, 한글을 고려한 키스트 로크를 기반으로 한 설계 방식 그리고 동적으로 에러모델을 구축하는 방법을 소개하고 있으며 또한 구축된 모델의 성능을 다른 검색 서비스와 비교한 결과를 소개한다.

  • PDF

A Comparative Analysis of Recursive Query Algorithm Implementations based on High Performance Distributed In-Memory Big Data Processing Platforms (대용량 데이터 처리를 위한 고속 분산 인메모리 플랫폼 기반 재귀적 질의 알고리즘들의 구현 및 비교분석)

  • Kang, Minseo;Kim, Jaesung;Lee, Jaegil
    • Journal of KIISE
    • /
    • v.43 no.6
    • /
    • pp.621-626
    • /
    • 2016
  • Recursive query algorithm is used in many social network services, e.g., reachability queries in social networks. Recently, the size of social network data has increased as social network services evolve. As a result, it is almost impossible to use the recursive query algorithm on a single machine. In this paper, we implement recursive query on two popular in-memory distributed platforms, Spark and Twister, to solve this problem. We evaluate the performance of two implementations using 50 machines on Amazon EC2, and real-world data sets: LiveJournal and ClueWeb. The result shows that recursive query algorithm shows better performance on Spark for the Livejournal input data set with relatively high average degree, but smaller vertices. However, recursive query on Twister is superior to Spark for the ClueWeb input data set with relatively low average degree, but many vertices.

Web Search Behavior Analysis Based on the Self-bundling Query Method (웹검색 행태 연구 - 사용자가 스스로 쿼리를 뭉치는 방법으로 -)

  • Lee, Joong-Seek
    • Journal of the Korean Society for Library and Information Science
    • /
    • v.45 no.2
    • /
    • pp.209-228
    • /
    • 2011
  • Web search behavior has evolved. People now search using many diverse information devices in various situations. To monitor these scattered and shifting search patterns, an improved way of learning and analysis are needed. Traditional web search studies relied on the server transaction logs and single query instance analysis. Since people use multiple smart devices and their searching occurs intermittently through a day, a bundled query research could look at the whole context as well as penetrating search needs. To observe and analyze bundled queries, we developed a proprietary research software set including a log catcher, query bundling tool, and bundle monitoring tool. In this system, users' daily search logs are sent to our analytic server, every night the users need to log on our bundling tool to package his/her queries, a built in web survey collects additional data, and our researcher performs deep interviews on a weekly basis. Out of 90 participants in the study, it was found that a normal user generates on average 4.75 query bundles a day, and each bundle contains 2.75 queries. Query bundles were categorized by; Query refinement vs. Topic refinement and 9 different sub-categories.

Natural Language Query Framework on the Semantic Web

  • Kim, Jin-Sung
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2007.04a
    • /
    • pp.189-192
    • /
    • 2007
  • This study proposes a Natural Language Query Framework (NLQF) on the semantic web to support the intelligent deduction at semantic level. A large number of former researches are focused on the knowledge representation on the semantic web. However, to revitalize the intelligent agent (IA)-based automated e-business contract with human customers, there is a need for semantic level approach to the web information. To enable accessing web information at semantic level, this paper discusses the pattern of complex natural language processing at first, and then the semantic web-based natural language inference in e-business environment. The NL-based approach could help the IAs on the web to communicate with customers and other IAs with more natural interface than traditional HTML-based web information. Therefore, our proposed NLQF will be used in semantic web-based intelligent e-business contracts between customers and IAs.

  • PDF

Semantic schema data processing using cache mechanism (캐쉬메카니즘을 이용한 시맨틱 스키마 데이터 처리)

  • Kim, Byung-Gon;Oh, Sung-Kyun
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.3
    • /
    • pp.89-97
    • /
    • 2011
  • In semantic web information system like ontology that access distributed information from network, efficient query processing requires an advanced caching mechanism to reduce the query response time. P2P network system have become an important infra structure in web environment. In P2P network system, when the query is initiated, reducing the demand of data transformation to source peer is important aspect of efficient query processing. Caching of query and query result takes a particular advantage by adding or removing a query term. Many of the answers may already be cached and can be delivered to the user right away. In web environment, semantic caching method has been proposed which manages the cache as a collection of semantic regions. In this paper, we propose the semantic caching technique in cluster environment of peers. Especially, using schema data filtering technique and schema similarity cache replacement method, we enhanced the query processing efficiency.

A Development of Query-Answer Learning Tool based on LTSA (LTSA 기반의 질의 응답 학습 도구 개발)

  • Kim, Haeng-Kon;Kim, Jung-Soo
    • The KIPS Transactions:PartA
    • /
    • v.10A no.3
    • /
    • pp.269-278
    • /
    • 2003
  • The popularity of the web based education has come the need for variety learning methods and for business to exploit the web not only for interoperability but also standardization. This way of standardization has come to researched for environments, contents and practical uses in ISO. The IEEE has special]y established five technical classes for LTSA which provide advanced e-learning environments. Feedback functions would not be supported and specified in standardization for Query Answer on LTSA. In this paper, we describe the query and answer model which we have developed on layer three of LTSA. We develop the redefined model for transforming data flow oriented into object or component based model. We have developed the Query Answer Metadata (QAM) based on Learning Object Metadata (LOM). We design and showed thing a prototyping implementation the Query Answer Learning Tool (QALT). We have used the QALT to address the problem of efficiency of web based education. We also used it to develop the related tools with quality and productivity.

Design and Implementation of Integrated Query System for e-Business Registries (e-비즈니스 레지스트리 통합 질의 시스템 설계 및 구현)

  • 김계용;이규철
    • Journal of Information Technology Applications and Management
    • /
    • v.10 no.1
    • /
    • pp.127-146
    • /
    • 2003
  • With the spread of Internet, e-business using Internet technology is being actively developed and operated. Currently, on behalf of the international e-business framework, International standard such as ebXML and Web Service is being advanced. We are able to publish and search business information through ebXML and Web Service and then actual trading between partners is accomplished. By the way, it is Registry that play an important part in e-business. Registry is an e-business infrastructure for enabling building, deploying, and the discovery of business Information. We can do e-business through Registries dynamically and share the resources. Representatives of Registry are ebXML and UDDI used as an international standard. We will meet with some problems when using Registries. ebXML Is focused on B2B collaborations and Web Service Is focused on application integrations. So we must use ebXML and Web Service characteristically, and sometimes use all at need. ebXML and Web Service contain business information by Registry specific way. So When using the services offered by ebXML and Web Service, we should access each Registry by using Registry specific tools. This thesis intended to integrate business information from ebXML Registry and UDDI Registry to accomplish e-business conveniently This thesis defined the common data model as well as integrated query language for integrated access to ebXML and Web Service along with design and implementation of the system.

  • PDF