• Title/Summary/Keyword: Relational Searching

Search Result 35, Processing Time 0.023 seconds

Design and Implementation of the Graphical Relational Searching for Folksonomy Tags in the Participational Architecture of Web 2.0 (웹2.0의 참여형 아키텍쳐 환경에서 그래픽 기반 포크소노미 태그 연관 검색의 설계 및 구현)

  • Kim, Woon-Yong;Park, Seok-Gyu
    • Journal of Internet Computing and Services
    • /
    • v.8 no.5
    • /
    • pp.1-10
    • /
    • 2007
  • Recently, the web 2.0 services which appear by exponential extension of the Internet can be expressed with the changes in the quality of structural evolution and in the quantity of increasing users. The structural base is in user participational architecture, the web 2.0 services such as Blog, UCC, SNS(Social Networking Service), Mash-up, Long tail, etc. play a important role in organization of web, and grouping and searching of user participational data in web 2.0 is broadly used by folksonomy. Folksonomy is a new form that categorizes by tags, not classic taxonomy skill. it is made by user participation. Searching based on tag is now done by a simple text or a tag cloud method. But searching to consider and express the relations among each tags is imperfect yet. Thus, this paper provides the relational searching based on tags using the relational graph of tags. It should improve the trust of the searching and provide the convenience of the searching.

  • PDF

Key Factors Influencing Online Relational Intimacy in the Context of Social Networking Services (SNS 환경에서 온라인 관계 친밀도에 영향을 미치는 선행 요인들)

  • Kim, Byoungsoo
    • Journal of Digital Convergence
    • /
    • v.18 no.7
    • /
    • pp.149-156
    • /
    • 2020
  • This study investigated the key factors affecting online relational intimacy in the context of SNS. Based on the use and gratification theory, self-presentation, relationship formation and information searching were identified as the main needs of SNS usage. These needs were expected to influence online relational intimacy through user satisfaction, subjective well-being, and disclosing information behaviors. The theoretical framework was validated by a longitudinal method. Hypotheses were tested by using the partial least squares to data from 199 Facebook users. Self-presentation and information searching had a significant impact on both user satisfaction and subjective well-being. However, relationship formation did not significantly affect both user satisfaction and subjective well-being. User satisfaction had a significant direct effect only on online relational intimacy. Subjective well-beings played a significant role in enhancing both disclosing information behaviors and online relational intimacy. Finally, it has been found that disclosing information behaviors are a key factor in enhancing online relational intimacy. The results of this study are expected to provide academic and practical implications for the key antecedents of online relational intimacy.

k-Bitmap Clustering Method for XML Data based on Relational DBMS (관계형 DBMS 기반의 XML 데이터를 위한 k-비트맵 클러스터링 기법)

  • Lee, Bum-Suk;Hwang, Byung-Yeon
    • The KIPS Transactions:PartD
    • /
    • v.16D no.6
    • /
    • pp.845-850
    • /
    • 2009
  • Use of XML data has been increased with growth of Web 2.0 environment. XML is recognized its advantages by using based technology of RSS or ATOM for transferring information from blogs and news feed. Bitmap clustering is a method to keep index in main memory based on Relational DBMS, and which performed better than the other XML indexing methods during the evaluation. Existing method generates too many clusters, and it causes deterioration of result of searching quality. This paper proposes k-Bitmap clustering method that can generate user defined k clusters to solve above-mentioned problem. The proposed method also keeps additional inverted index for searching excluded terms from representative bits of k-Bitmap. We performed evaluation and the result shows that the users can control the number of clusters. Also our method has high recall value in single term search, and it guarantees the searching result includes all related documents for its query with keeping two indices.

Relational Database Structure for Preserving Multi-role Topics in Topic Map (토픽맵의 다중역할 토픽 보존을 위한 관계형 데이터베이스 구조)

  • Jung, Yoonsoo;Y., Choon;Kim, Namgyu
    • The Journal of Information Systems
    • /
    • v.18 no.3
    • /
    • pp.327-349
    • /
    • 2009
  • Traditional keyword-based searching methods suffer from low accuracy and high complexity due to the rapid growth in the amount of information. Accordingly, many researchers attempt to implement a so-called semantic search which is based on the semantics of the user's query. Semantic information can be described using a semantic modeling language, such as Topic Map. In this paper, we propose a new method to map a topic map to a traditional Relational Database (RDB) without any information loss. Although there have been a few attempts to map topic maps to RDB, they have paid scant attention to handling multi-role topics. In this paper, we propose a new storage structure to map multi-role topics to traditional RDB. The proposed structure consists of a mapping table, role tables, and content tables. Additionally, we devise a query translator to convert a user's query to one appropriate to the proposed structure.

  • PDF

Dynamic Classification of Categories in Web Search Environment (웹 검색 환경에서 범주의 동적인 분류)

  • Choi Bum-Ghi;Lee Ju-Hong;Park Sun
    • Journal of KIISE:Software and Applications
    • /
    • v.33 no.7
    • /
    • pp.646-654
    • /
    • 2006
  • Directory searching and index searching methods are two main methods in web search engines. Both of the methods are applied to most of the well-known Internet search engines, which enable users to choose the other method if they are not satisfied with results shown by one method. That is, Index searching tends to come up with too many search results, while directory searching has a difficulty in selecting proper categories, frequently mislead to false ones. In this paper, we propose a novel method in which a category hierarchy is dynamically constructed. To do this, a category is regarded as a fuzzy set which includes keywords. Similarly extensible subcategories of a category can be found using fuzzy relational products. The merit of this method is to enhance the recall rate of directory search by expanding subcategories on the basis of similarity.

A Time-Segmented Storage Structure and Migration Strategies for Temporal Data (시간지원 데이터를 위한 분리 저장 구조와 데이터 이동 방법)

  • Yun, Hong-Won;Kim, Gyeong-Seok
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.4
    • /
    • pp.851-867
    • /
    • 1999
  • Numerous proposals for extending the relational data model as well as conceptual and object-oriented data models have been suggested. However, there has been relatively less research in the area of defining segmented storage structure and data migration strategies for temporal data. This paper presents the segmented storage structure in order to increment search performance and the two data migration strategies for segmented storage structure. this paper presents the two data migration strategies : the migration strategy by Time granularity, the migration strategy by LST-GET. In the migration strategy by Time Granularity, the dividing time point to assign the entity versions to the past segment, the current segment, and future segment is defined and the searching and moving process for data validity at a granularity level are described. In the migration strategy by LST-GET, we describe the process how to compute the value of dividing criterion. searching and moving processes are described for migration on the future segment and the current segment and entity versions 새 assign on each segment are defined. We simulate the search performance of the segmented storage structure in order to compare it with conventional storage structure in relational database system. And extensive simulation studies are performed in order to compare the search performance of the migration strategies with the segmented storage structure.

  • PDF

Path Combining System of XML Documents based on Relational DBMS (관계형 DBMS 기반의 XML 문서 경로 통합 시스템)

  • Lee, Bum-Suk;Hwang, Byung-Yeon
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.4
    • /
    • pp.415-422
    • /
    • 2008
  • With the increasing use of XML, considerable research is being conducted on the XML document management systems for more efficient storage and searching of XML documents. Depending on the base systems, these researches can be classified into object-oriented DBMS (OODBMS) and relational DBMS (RDBMS). OODBMS-based systems are better suited to reflect the structure of XML-documents than RDBMS based ones. However, using an XML parser to map the contents of documents to relational tables is a better way to construct a stable and effective XML document management system. The proposed X-Binder system uses an RDBMS-based inverted index; this guarantees high searching speed but wastes considerable storage space. To avoid this, the proposed system incorporates a path combining module agent that combines paths with sibling relations, and stores them in a single row. Performance evaluation revealed that the proposed system reduces storage wastage and search time.

  • PDF

Study on the relationship between the flow experience art purchase intention when navigating World Wide Web (WWW 항해시의 Flow 경험과 구매의도와의 관계 연구)

  • 김병철
    • Proceedings of the Technology Innovation Conference
    • /
    • 1999.12a
    • /
    • pp.296-327
    • /
    • 1999
  • Nowadays, there is a huge need of an extensive study to understand features and behavior modes of consumers who have an indefinite potential of purchase and to make EC a bullish market, Recently, the flow construct has been proposed as important for understanding consumer behavior on the cyber space. The purpose of this study is threefold. To investigate (1) the effect of the flow experience when navigating Internet shopping-mall sites and Internet on purchase intention and relational factors of this (2) the difference in the flow experiences between during the time of navigating Internet and during the time of navigating Internet shopping-mall sites. (3) the difference in purchase intention and relational factors of this between an experiential flow and a purposeful flow. The results show that (1) increase of the purchase intention on EC (or relational factors of this) in proportion to the degree of cognition of users' flow experience (2) By the separate motive of searching Internet shopping-mall sites, the flow experiences during the time of navigating Internet lead to different results (3) Although the difference in the purchase intention on EC between subjects is nonsignificant, it suggests that we need to focus on the fact that the correlation between the purchase intention on EC and the purposeful flow experience on Internet shopping-mall sites is greater than any other correlation. In the end of this study, The theoretical and practical implications of the study, limitations of the study, and future research implications are discussed.

  • PDF

Alternative Causal Relationship among Components of Intellectual Capital in Korean Public R&D Organizations (공공연구기관의 지적자본 측정 및 인과관계 연구)

  • Kang, Dae Seok;Jeon, Byoung Hoon;Kim, Nung Jin
    • Knowledge Management Research
    • /
    • v.13 no.4
    • /
    • pp.55-69
    • /
    • 2012
  • This paper developed measurement indices for intellectual capital of public R&D organizations and investigated causal relationships among the components. We developed 10 measurement factors and 37 indicators and confirmed the reliability of these measurements. We offered an alternative to the existing model for searching causal relationships. From our survey research, using the structural equation model, we found a new relationship. In contrast to the existing model, we found a cycling relationship among three variables: human capital causes structural capital, structural capital causes relational capital, and relational capital causes human capital.

  • PDF

Segment-Based Inverted Index for Querying Large XML Documents (대용량 XML 문서의 효율적인 질의 처리를 위한 세그먼트 기반 역 인덱스)

  • Jeong, Byeong-Soo;Lee, Hiye-Ja
    • Journal of Information Technology Services
    • /
    • v.7 no.3
    • /
    • pp.145-157
    • /
    • 2008
  • The existing XML storage methods which use relational data model, usually store path information for every node type including literal contents in order to keep the structural information of XML documents. Such path information is usually maintained by an inverted index to efficiently process XPath queries for large XML documents. In this study, We propose an improved approach that retrieve information from the large volume of XML documents stored in a relational database, while using a segment-based inverted index for path searches. Our new approach can reduce the number of searching an inverted index for getting target path information. We show the effectiveness of this approach through several experiments that compare XPath query performance with the existing methods.