• Journal of Korea Multimedia Society
• /
• v.13 no.9
• /
• pp.1299-1313
• /
• 2010

Top-k queries return k objects that users most want in the database. The Partitioned-Layer Index (simply, the PL -index) is a representative method for processing the top-k queries efficiently. The PL-index partitions the database into a number of smaller databases, and then, for each partitioned database, constructs a list of sublayers over the partitioned database. Here, the $i^{th}$ sublayer in the partitioned database has the objects that can be the top-i object in the partitioned one. To retrieve top k results, the PL-index merges the sublayer lists depending on the user's query. The PL-index has the advantage of reading a very small number of objects from the database when processing the queries. However, since many random accesses occur in merging the sublayer lists, query performance of the PL-index is not good in environments like disk-based databases. In this paper, we propose the Abstracted Partitioned-Layer Index (simply, the APL-index) that significantly improves the query performance of the PL-index in disk-based environments by reducing the number of random accesses. First, by abstracting each sublayer of the PL -index into a virtual (point) object, we transform the lists of sublayers into those of virtual objects (ie., the APL-index). Then, we virtually process the given query by using the APL-index and, accordingly, predict sublayers that are to be read when actually processing the query. Next, we read the sublayers predicted from each sublayer list at a time. Accordingly, we reduce the number of random accesses that occur in the PL-index. Experimental results using synthetic and real data sets show that our APL-index proposed can significantly reduce the number of random accesses occurring in the PL-index.

• Journal of KIISE:Databases
• /
• v.33 no.7
• /
• pp.754-765
• /
• 2006

In XML keyword search, a search result is defined as a set of the smallest elements (i.e., least common ancestors) containing all query keywords and a granularity of indexing is an XML element instead of a document. Under the conventional index structure, all least common ancestors produced by the combination of the elements, each of which contains a query keyword, are considered as a search result. In this paper, to avoid unnecessary operations of producing the least common ancestors and reduce query process time, we describe a way to construct a partitioned index composed of several partitions and produce a search result by merging those partitions if necessary. When a search result is restricted to be composed of the least common ancestors whose depths are higher than a given minimum depth, under the proposed partitioned index structure, search systems can reduce the query process time by considering only combinations of the elements belonging to the same partition. Even though the minimum depth is not given or unknown, search systems can obtain a search result with the partitioned index, which requires the same query process time to obtain the search result with non-partitioned index. Our experiment was conducted with the XML documents provided by the DBLP site and INEX2003, and the partitioned index could reduce a substantial amount of query processing time when the minimum depth is given.

• Journal of Korea Multimedia Society
• /
• v.11 no.7
• /
• pp.905-913
• /
• 2008

Many heterogeneous XML documents are being widely used with the increasing employment of XML, and the importance of data structure research for more efficient document management has been growing steadily. We propose a query processing technique which uses parent node information in a partitioned inverted index tree. The searching efficiency of these heterogeneous documents is greatly influenced by the number of query processing and the amount of target data sets in many ways. Therefore, considering these two factors is very important for designing a data structure. First, our technique stores parent node's information in an inverted index table. Then using this information, we can reduce the number of query processing by half. Also, the amount of target data sets can be lessoned by using partitioned inverted index table. Some XML documents collected from the Internet will be used to demonstrate the new method, and its high efficiency will be compared with some of the existing searching methods.

• Journal of KIISE:Databases
• /
• v.31 no.6
• /
• pp.710-720
• /
• 2004

As XML documents have much richer information than plain texts, we can perform very elaborated, fine-grained search which was difficult in past years. However, as the cost of finer grained element level search is very high, the processing overhead has become a new challenge. We propose an inverted index structure called PIX, which reduces the number of elements processed by partitioning elements according to their match potentiality. We choose a base level and partition elements according to whether they have possibility of having a common ancestor higher than the level. We also propose partition merging technique by which we can get same results as unpartitioned case. Our experimental results show that the index partitioning strategy can reduce processing time considerably.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.19 no.6
• /
• pp.9-16
• /
• 1982

This is an introduction to an art of digital hardware design using polymachine image as a target structure of the product. As in the case of software design of a computer, the design process begins with a sketch of planned system in flow chart description and the flow charts is partitioned into divergent elements. Each of the element machine is derived from those divergent elements. We can build a complete digital system with the preparation of an index, and a polymer of these element machines.

• The Korean Journal of Pain
• /
• v.9 no.1
• /
• pp.130-134
• /
• 1996

Background: This study was designed to determine the distance from skin to lumbar epidural space in obstetric parturients and whether weight, height, or PI (ponderal index, $kg/m^2$) might influence the epidural depth. Methods: 71 obstetric patients undergoing elective cesarean section during epidural anesthesia in L2-3 level were partitioned into groups according to their prepregnant BMI(body mass index), and in each group weight, height, PI, epidural depth were measured. Results: All patients were classified as underweight(n=18), normal(n=49), overweight(n=4) and no one was partitioned into obese group. the distance from skin to lumbar epidural space was found to be 3.7 cm(underweight), 4.1 cm(normal), 4.7 cm(over weight) and total mean distance was found to be 4.0 cm. The epidural depth had correlation with weight and height in underweight, and weight and PI in normal, but had no correlation with any measurements in overweight group. Conclusion: These results suggest body weight may be a useful parameter for predicting the distance from skin to lumbar epidural space in underweight and normal weight obstetric parturients.

• Journal of the Optical Society of Korea
• /
• v.17 no.3
• /
• pp.262-268
• /
• 2013

We study the focusing properties of a two-dimensional square-lattice photonic crystal (PC) comprising silica and germanium partitioned cylinders in air background. The finite difference time domain (FDTD) method with periodic boundary condition is utilized to calculate the dispersion band diagram and the FDTD method incorporating the perfectly matched layer boundary condition is employed to simulate the image formation. In contrast to the common square PCs in which the negative refraction effect occurs in the first photonic band without negative phase propagation, in our suggested model system, the frequency with negative refraction exists in the second band and in near-infrared region. In this case, the wave propagates with a negative phase velocity and the evanescent waves can be supported. We also discuss the dependency of the image resolution and its location on surface termination, source location, and slab thickness. According to the simulation results, spatial resolution of the proposed PC lens is below the radiation wavelength.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.6
• /
• pp.1407-1417
• /
• 1996

In recent researches on thread partitioning algorithms break a thread at the long latency operation and merge threads to get the longer threads under the given constraints. Due to this limitation, even a program with little parallelism is partitioned into small-sized threads and context-swithings occur frequently. In the paper, we propose another method array localization about the array name, dependence distance(the difference of accessed element index from loop index), and the element usage that indicates whether element is used or defined. Using this information we can allocate array elements to the node where the corresponding loop activation is executed. By array localization, remote accesses to array elements can be replaced with local accesses to localized array elements. As a resuit,the boundaries of some threads are removed, programs can be partitioned into the larger threads and the number of context switchings reduced.

• Journal of KIISE:Databases
• /
• v.32 no.2
• /
• pp.129-141
• /
• 2005

Although spatio-temporal databases have received considerable attention recently, there has been little work on processing range sum queries on the historical records of moving objects despite their importance. Since to answer range sum queries, the direct access to a huge amount of data incurs prohibitive computation cost, materialization techniques based on existing index structures are recently suggested. A simple but effective solution is to apply the materialization technique to the MVR-tree known as the most efficient structure for window queries with spatio-temporal conditions. However, the MVR-tree has a difficulty in maintaining pre-aggregated results inside its internal nodes due to cyclic paths between nodes. Aggregate structures based on other index structures such as the HR-tree and the 3DR-tree do not provide satisfactory query performance. In this paper, we propose a new indexing technique called the Adaptive Partitioned Aggregate R-Tree (APART) and query processing algorithms to efficiently process range sum queries in many situations. Experimental results show that the performance of the APART is typically above 2 times better than existing aggregate structures in a wide range of scenarios.

• Journal of International Society for Simulation Surgery
• /
• v.3 no.2
• /
• pp.46-48
• /
• 2016

Purpose In face reocognition area, estimating occlusion in face images is on the rise. In this paper, we propose a new face recognition algorithm based on dual sparse representation to solve this problem. Method Each face image is partitioned into several pieces and sparse representation is implemented in each part. Then, some parts that have large sparse concentration index are combined and sparse representation is performed one more time. Each test sample is classified by using the final sparse coefficient where correlation between the test sample and training sample is applied. Results The recognition rate of the proposed algorithm is higher than that of the basic sparse representation classification. Conclusion The proposed method can be applied in real life which needs to identify someone exactly whether the person disguises his face or not.