• Title/Summary/Keyword: Hierarchical Index

Search Result 258, Processing Time 0.029 seconds

THE VERTEX AND EDGE PI INDICES OF GENERALIZED HIERARCHICAL PRODUCT OF GRAPHS

  • Tavakoli, M.;Rahbarnia, F.
    • Journal of applied mathematics & informatics
    • /
    • v.31 no.3_4
    • /
    • pp.469-477
    • /
    • 2013
  • Pattabiraman and Paulraja [K. Pattabiraman, P. Paulraja, Vertex and edge PI indices of the generalized hierarchical product of graphs, Discrete Appl. Math. 160 (2012) 1376- 1384] obtained exact formulas for the vertex and edge PI indices of generalized hierarchical product of graphs. The aim of this note is to improve the main results of this paper.

An Efficient Index Structure for Semantic-based XML Keyword Search (의미 기반의 XML키워드 검색을 위한 효율적인 인덱스 구조)

  • Lee, Hyung-Dong;Kim, Sung-Jin;Kim, Hyoung-Joo
    • Journal of KIISE:Databases
    • /
    • v.33 no.5
    • /
    • pp.513-525
    • /
    • 2006
  • Search results of XML keyword search are defined generally as the most specific elements containing all query keywords in the literature. The labels of XML elements and semantic information such as ontology, conceptual model, thesaurus, and so on, are used to improve the preciseness of the search results. This paper presents a hierarchical index for an efficient XML keyword query processing on the condition that returnable search concepts are defined and users' query concepts can be interpreted with the help of the semantic information. The hierarchical index separately stores the XML elements containing a keyword on the basis of the hierarchical relations of the concepts that the XML elements belong to, and makes it possible to obtain least common ancestors, which are candidates for the search results, with selectively reading the elements belonging to the concepts relevant to query concepts and without considering all the combinations of the elements having been read. This paper deals with how to organize the hierarchical index and how to process XML keyword queries with the index. In our experiment with the DBLP XML document and the XML documents in the INEX2003 test set, the hierarchical index worked well.

The Implementation Performance Evaluation of PR-File Based on Circular ar Domain (순환도메인을 기반으로 하는 PR-화일의 구현 및 성능 평가)

  • Kim, Hong-Ki;Hwang, Bu-Hyun
    • The Transactions of the Korea Information Processing Society
    • /
    • v.3 no.1
    • /
    • pp.63-76
    • /
    • 1996
  • In this paper, we propose a new dynamic spatial index structure, called PR -file, for handling spatial objects and the modified hierarchical variance which measures the degree of spatial locality at each level. Under the assumption that a multidimensional search space has a circular domain, PR-file uses the modified hierarchical variance for clustering spatially adjacent objects. The insertion and splitting algorithms of PR_file preserve and index which has a low hierarchical variance regardless of object distributions. The simulation result shows that PR- file has a high hit ratio during a retrieval of objects by using an index with low hierarchical variance. And it shows a characteristic that the larger the bucket capacity, the higher the bucket utilization.

  • PDF

Building Hierarchical Bitmap Indices in Space Constrained Environments (저장 공간이 제약된 환경에서 계층적 비트맵 인덱스 생성에 관한 연구)

  • Kim, Jong Wook
    • Journal of Digital Contents Society
    • /
    • v.16 no.1
    • /
    • pp.33-41
    • /
    • 2015
  • Since bitmap indices are useful for OLAP queries over low-cardinality data columns, they are frequently used in data warehouses. In many data warehouse applications, the domain of a column tends to be hierarchical, such as categorical data and geographical data. When the domain of a column is hierarchical, hierarchical bitmap index is able to significantly improve the performance of queries with conditions on that column. This strategy, however, has a limitation in that when a large scale hierarchy is used, building a bimamp for each distinct node leads to a large space overhead. Thus, in this paper, we introduce the way to build hierarchical bitmap index on an attribute whose domain is organized into a large-scale hierarchy in space-constrained environments. Especially, in order to figure out space overhead of hierarchical bitmap indices, we propose the cut-selection strategy which divides the entire hierarchy into two exclusive regions.

Posterior Inference in Single-Index Models

  • Park, Chun-Gun;Yang, Wan-Yeon;Kim, Yeong-Hwa
    • Communications for Statistical Applications and Methods
    • /
    • v.11 no.1
    • /
    • pp.161-168
    • /
    • 2004
  • A single-index model is useful in fields which employ multidimensional regression models. Many methods have been developed in parametric and nonparametric approaches. In this paper, posterior inference is considered and a wavelet series is thought of as a function approximated to a true function in the single-index model. The posterior inference needs a prior distribution for each parameter estimated. A prior distribution of each coefficient of the wavelet series is proposed as a hierarchical distribution. A direction $\beta$ is assumed with a unit vector and affects estimate of the true function. Because of the constraint of the direction, a transformation, a spherical polar coordinate $\theta$, of the direction is required. Since the posterior distribution of the direction is unknown, we apply a Metropolis-Hastings algorithm to generate random samples of the direction. Through a Monte Carlo simulation we investigate estimates of the true function and the direction.

A Hierarchical Bayesian Model for Survey Data with Nonresponse

  • Han, Geunshik
    • Journal of the Korean Statistical Society
    • /
    • v.30 no.3
    • /
    • pp.435-451
    • /
    • 2001
  • We describe a hierarchical bayesian model to analyze multinomial nonignorable nonresponse data. Using a Dirichlet and beta prior to model the cell probabilities, We develop a complete hierarchical bayesian analysis for multinomial proportions without making any algebraic approximation. Inference is sampling based and Markove chain Monte Carlo methods are used to perform the computations. We apply our method to the dta on body mass index(BMI) and show the model works reasonably well.

  • PDF

A Study on analysis of architecture and user interface at cyber museum (Cyber Museum User Interface의 구성과 구조에 관한 고찰)

  • 구세연;임채진
    • Proceedings of the Korean Institute of Interior Design Conference
    • /
    • 2001.05a
    • /
    • pp.121-127
    • /
    • 2001
  • An unified measure of user interface efficiency and aesthetics for cyber museum is proposed. First, general structure of cyber museum is discussed and hierarchical analyses are done for sample sites. Usability tests based on the hierarchical analyses yield statistics of user access frequency and persistency for each page, on which access probability is deduced. Second, visual occupancy, a measure of efficiency of user interface element based on access probability is defined. The hierarchical statistics of visual occupancy can be an index for characterization and classification of cyber museums. Examples are provided.

  • PDF

A Hierarchical Index Technique for Moving Image Retrieval System based on MPEG-7 (MPEG-7에 기반한 동영상 검색 시스템을 위한 계층형 인덱스 기법)

  • Kim Tack gon;Kim Woo saeng
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.10C
    • /
    • pp.1444-1450
    • /
    • 2004
  • MPEG-7 based on XML represents various information of multimedia data's contents. and it support search and browsing by user's wants. But, MPEG-7 standard don't support retrieval method and Many XML Indexing is not compatible to retrieval MPEG-7 documents. So Much research activity and interest has emerged recently in retrieval MPEG-7 documents. In our paper, we suppose a hierarchical index based on MPEG-7 document's structural information, and review how to query processing based on high level feature description.

A Hierarchical Sequential Index Scheme for Range Queries in Wireless Location-based Services (무선 위치기반서비스에서 영역질의처리를 위한 계층적 인덱스기법)

  • Park, Kwang-Jin
    • Journal of Internet Computing and Services
    • /
    • v.11 no.1
    • /
    • pp.15-20
    • /
    • 2010
  • In this paper, we propose a novel approach to reduce spatial query access latency and energy consumption by leveraging results from nearby peers in wireless broadcast environments. We propose a three-tier Hierarchical Location-Based Sequential access index, called HLBS, which provides selective tuning (pruning and searching entries) without pointers using a linear accessing structure based on the location of each data object. The HLBS saves search cost and index overhead, since the small index size with a sequential index structure results in low access latency overhead and facilitates efficient searches for sequential-access media (wireless channels with data broadcast). Comprehensive experiments illustrate that the proposed scheme is more efficient than the previous techniques in terms of energy consumption.

Clustering load patterns recorded from advanced metering infrastructure (AMI로부터 측정된 전력사용데이터에 대한 군집 분석)

  • Ann, Hyojung;Lim, Yaeji
    • The Korean Journal of Applied Statistics
    • /
    • v.34 no.6
    • /
    • pp.969-977
    • /
    • 2021
  • We cluster the electricity consumption of households in A-apartment in Seoul, Korea using Hierarchical K-means clustering algorithm. The data is recorded from the advanced metering infrastructure (AMI), and we focus on the electricity consumption during evening weekdays in summer. Compare to the conventional clustering algorithms, Hierarchical K-means clustering algorithm is recently applied to the electricity usage data, and it can identify usage patterns while reducing dimension. We apply Hierarchical K-means algorithm to the AMI data, and compare the results based on the various clustering validity indexes. The results show that the electricity usage patterns are well-identified, and it is expected to be utilized as a major basis for future applications in various fields.