• The Transactions of the Korea Information Processing Society
• /
• v.6 no.4
• /
• pp.841-850
• /
• 1999

Many commercial database systems maintain histograms to summarize the contents of relations, permit efficient estimation of query result sizes, and access plan costs. In spatial database systems, most query predicates consist of topological relationship between spatial objects, and ti is ver important to estimate the selectivity of those predicates for spatial query optimizer. In this paper, we propose a selectivity estimation scheme for spatial topological predicates based on the multi-dimensional histogram and the transformation scheme. Proposed scheme applies two partition strategies on transformed object space to generate spatial histogram, and estimates the selectivity of topological predicates based on the topological characteristic of transformed space. Proposed scheme provides a way for estimating the selectivity without too much memory space usage and additional I/Os in spatial query optimizer.

• The KIPS Transactions:PartD
• /
• v.11D no.2
• /
• pp.281-292
• /
• 2004

Selectivity estimation for spatial query is very important process used in finding the most efficient execution plan. Many works have been performed to estimate accurate selectivity. Although they deal with some problems such as false-count, multi-count, they can not get such effects in little memory space. Therefore, we propose a new technique called MW Histogram which is able to compress summary data and get reasonable results and has a flexible structure to react dynamic update. Our method is based on two techniques : (a) MinSkew partitioning algorithm which deal with skewed spatial datasets efficiently (b) Wavelet transformation which compression effect is proven. The experimental results showed that the MW Histogram which the buckets and wavelet coefficients ratio is 0.3 is lower relative error than MinSkew Histogram about 5%-20% queries, demonstrates that MW histogram gets a good selectivity in little memory.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.9
• /
• pp.24-36
• /
• 1996

In this paper, we discuss the errors in selectivity estimation using the multilevel grid file (MLGF). We first demonstrate that the estimatio errors stem from the uniformity assumption that records are uniformly distributed in their belonging region represented by an entry in a level of an MLGF directory. Bsed on this demonstration, we then investigate five factors affecting the accuracy of estimation: (1) the data distribution in a region (2) the number of records stored in an MLFG (3) the page size, (4) the query region size, and (5) the level of an MLFG directory. Next we present the tendancy of estimation errors according to the change of values for each factor through experiments. The results show that the errors decrease when (1) the distribution of records in a region becomes closer to the uniform one, (2) the number of records in an MLFG increases, (3) the page size decreases, (4) the query region size increases, and (5) the level of an MLFG directory employed as data distribution information becomes lower. After the definition of the granule ratio, the core formula representing the basic relationship between the estimation errors and the above five factors, we finally examine the change of estimation errors according to the change of the values for the granule ratio through experiments. The results indicate that errors tend to be similar depending on the values for the granule ratio regardless of the various changes of the values for the five factors. factors affecting the accuracy of estimation:

• Journal of the Korean Society of Fisheries and Ocean Technology
• /
• v.48 no.1
• /
• pp.10-19
• /
• 2012

The mesh selectivity of a drift net for yellow croaker (Larimichthys polyactis) was examined in field experiments with six different net mesh size (40, 45, 50, 55, 60 and 65mm) from April to December, 2008 in the coastal areas of Jeollanam-do in Korea. The total catch of 6,748 consisted of yellow croaker (n=6,310; 89.1% of total catch), common mackerel (n=158; 5.6%) and other species (n=280; 9.6%). The selectivity curve for yellow croaker was fit by the models of selectivity curve in SELECT method. The optimal mesh size for 50% retention for minimum landing size (191mm) of yellow croaker was estimated as 49.6mm-51mm by selectivity curves. And the bi-normal model for the selectivity curve was found to fit the data best.

• Journal of KIISE:Databases
• /
• v.35 no.1
• /
• pp.54-66
• /
• 2008

A spatio-temporal join is an expensive operation that is commonly used in spatio-temporal database systems. In order to generate an efficient query plan for the queries involving spatio-temporal join operations, it is crucial to estimate accurate selectivity for the join operations. Given two dataset $S_1,\;S_2$ of discrete data and a timestamp $t_q$, a spatio-temporal join retrieves all pairs of objects that are intersected each other at $t_q$. The selectivity of the join operation equals the number of retrieved pairs divided by the cardinality of the Cartesian product $S_1{\times}S_2$. In this paper, we propose aspatio-temporal histogram to estimate selectivity of spatio-temporal join by extending existing geometric histogram. By using a wide spectrum of both uniform dataset and skewed dataset, it is shown that our proposed method, called Spatio-Temporal Histogram, can accurately estimate the selectivity of spatio-temporal join. Our contributions can be summarized as follows: First, the selectivity estimation of spatio-temporal join for discrete data has been first attempted. Second, we propose an efficient maintenance method that reconstructs histograms using compression of spatial statistical information during the lifespan of discrete data.

• Journal of KIISE:Databases
• /
• v.30 no.2
• /
• pp.168-175
• /
• 2003

Until now, substring selectivities have been estimated by two steps. First step is to build up a count-suffix tree, which has statistical information about substrings, and second step is to estimate substring selectivity using it. However, it's actually impossible to build up a count-suffix tree from biological sequences because their lengths are too long. So, this paper proposes a novel data structure, count q-gram tree, consisting of fixed length substrings. The Count q-gram tree retains the exact counts of all substrings whose lengths are equal to or less than q and this tree is generated in 0(N) time and in site not subject to total length of all sequences, N. This paper also presents an estimation technique, k-MO. k-MO can choose overlapping length of splitted substrings from a query string, and this choice will affect accuracy of selectivity and query processing time. Experiments show k-MO can estimate very accurately.

• Journal of KIISE:Databases
• /
• v.34 no.2
• /
• pp.141-152
• /
• 2007

Selectivity estimation has been a crucial component in query optimization in relational databases. While extensive researches have been done on this topic for the predicates of numerical data, only little work has been done for substring predicates. We propose novel suffix tree transform algorithms for this problem. Unlike previous approaches where a full suffix tree is pruned and then an estimation algorithm is employed, we transform a suffix tree into a suffix graph systematically. In our approach, nodes with similar counts are merged while structural information in the original suffix tree is preserved in a controlled manner. We present both an error-bound algorithm and a space-bound algorithm. Experimental results with real life data sets show that our algorithms have lower average relative error than that of the previous works as well as good error distribution characteristics.

• Journal of the Korean Society of Fisheries and Ocean Technology
• /
• v.59 no.2
• /
• pp.99-109
• /
• 2023

In this study, a comparative test operation was conducted through the alternate haul method to examine the selectivity of the four mesh sizes (60 mm, 90 mm, 110 mm, and 130 mm) of the trawl codend. The selectivity was analyzed using the SELECT model considering the fishing efficiency (split parameter) of each fishing gear in the comparative test fishing operation in the trawl and the maximum likelihood method for parameter estimation. A selectivity master curve was estimated for several mesh sizes using the extended-SELECT model. As a result of analyzing the selectivity for silver croaker based on the results of three times hauls for each experimental gear, it was found that the size of the fish caught increased as the size of the mesh size increased. When the selectivity for each mesh size analyzed by the SELECT model considering the split ratio was evaluated based on the size of the AIC value, the estimated split model was superior to the equal split model. Based on the master curve, the 50% selection length value was 2.893, which was estimated to be 136 mm based on the mesh size of 60 mm. In some selectivity models, there was a large deviance between observed and theoretical values due to the non-uniformity of the distribution of fished length classes. As a result, it is considered that appropriate sea trials and selectivity evaluation methods with high reliability should be applied to present trawl fishery resource management methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.7C
• /
• pp.481-487
• /
• 2011

Cyclic delay diversity (CDD) is a simple transmit diversity technique for an OFDM system using multiple transmit antennas. However, the performance of post-FFT estimation, i.e., integer frequency offset (lFO) is deteriorated by high frequency selectivity introduced by CDD. In this paper, the IFO estimation scheme is proposed for OFDM-based DRM+ system with CDD. Based on the pilot subset partitioning, the proposed IFO estimation scheme reduces the effect of performance degradation caused by frequency selectivity in OFDM systems with CDD . The simulation results show that the performance of the proposed IFO estimator is significantly improved when compared to that of the conventional IFO estimator.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10b
• /
• pp.188-190
• /
• 1998

데이터 베이스 관리 시스템에서는 질의 결과의 크기(selectivity)를 미리 예측하는 것이 필요하다. 질의 결과의 크기는 데이터의 분포 상태에 의해서 결정된다. 이러한 데이터의 분포 상태를 정확하게 예측하는 것이 매우 중요하다. 대부분의 데이터 베이스 관리 시스템에서는 이를 위하여 주기적으로 저장하고 있는 레코드에 대해서 히스토그램을 만들고 이용한다. 이 방법은 히스토그램의 저장공간이 적게 필요로 하고 선택도를 추정하는데 있어서 선택도 추정시 부가적인 계산이 필요하지 않은 장점이 있지만, 일정한 크기의 버켓내에서는 데이터들이 균일하게 분포한다는 가정을 함으로써 선택도 추정에 있어서 에러율이 높았다. 이에 본 논문에서는 커널 방법을 사용하여 버켓 내 데이터의 분포에 대하여 추정 함으로써 이를 해결하는 방법을 제시하였다.