• Title/Summary/Keyword: Indexing Technique

Search Result 203, Processing Time 0.025 seconds

Context-based Incremental Preference Analysis Method in Ubiquitous Commerce (유비쿼터스 상거래 환경의 컨텍스트 기반 점진적 선호 분석 기법)

  • Ku Mi Sug;Hwang Jeong Hee;Choi Nam Kyu;Jung Doo Young;Ryu Keun Ho
    • The KIPS Transactions:PartD
    • /
    • v.11D no.7 s.96
    • /
    • pp.1417-1426
    • /
    • 2004
  • As Ubiquitous commerce is coming personalization service is getting interested. And also the recommendation method which offers useful information to customer becomes more important. However, most of them depend on specific method and are restricted to the E-commerce. For applying these recommendation methods into U-commerce, first it is necessary that the extended context modeling and systematic connection of the methods to complement strength and weakness of recommendation methods in each commercial transaction. Therefore, we propose a mod-eling technique of context information related to personal activation in commercial transaction and show incremental preference analysis method, using preference tree which is closely connected to recommendation method in each step. And also, we use an XML indexing technique to effi-ciently extract the recommendation information from a preference tree.

A Data Mining Approach for Selecting Bitmap Join Indices

  • Bellatreche, Ladjel;Missaoui, Rokia;Necir, Hamid;Drias, Habiba
    • Journal of Computing Science and Engineering
    • /
    • v.1 no.2
    • /
    • pp.177-194
    • /
    • 2007
  • Index selection is one of the most important decisions to take in the physical design of relational data warehouses. Indices reduce significantly the cost of processing complex OLAP queries, but require storage cost and induce maintenance overhead. Two main types of indices are available: mono-attribute indices (e.g., B-tree, bitmap, hash, etc.) and multi-attribute indices (join indices, bitmap join indices). To optimize star join queries characterized by joins between a large fact table and multiple dimension tables and selections on dimension tables, bitmap join indices are well adapted. They require less storage cost due to their binary representation. However, selecting these indices is a difficult task due to the exponential number of candidate attributes to be indexed. Most of approaches for index selection follow two main steps: (1) pruning the search space (i.e., reducing the number of candidate attributes) and (2) selecting indices using the pruned search space. In this paper, we first propose a data mining driven approach to prune the search space of bitmap join index selection problem. As opposed to an existing our technique that only uses frequency of attributes in queries as a pruning metric, our technique uses not only frequencies, but also other parameters such as the size of dimension tables involved in the indexing process, size of each dimension tuple, and page size on disk. We then define a greedy algorithm to select bitmap join indices that minimize processing cost and verify storage constraint. Finally, in order to evaluate the efficiency of our approach, we compare it with some existing techniques.

A Distributed Spatial Indexing Technique based on Hilbert Curve and MBR for k-NN Query Processing in a Single Broadcast Channel Environment (단일방송채널환경에서 k-최근접질의 처리를 위한 힐버트 곡선과 최소영역 사각형 기반의 분산 공간 인덱싱 기법)

  • Yi, Jung-Hyung;Jung, Sung-Won
    • Journal of KIISE:Databases
    • /
    • v.37 no.4
    • /
    • pp.203-208
    • /
    • 2010
  • This paper deals with an efficient index scheduling technique based on Hilbert curve and MBR for k-NN query in a single wireless broadcast channel environment. Previous works have two major problems. One is that they need a long time to process queries due to the back-tracking problem. The other is that they have to download too many spatial data since they can not reduce search space rapidly. Our proposed method broadcasts spatial data based on Hilbert curve order where a distributed index table is also broadcast with each spatial data. Each entry of index table represents the MBR which groups spatial data. By predicting the unknown location of spatial data, our proposed index scheme allows mobile clients to remove unnecessary data and to reduce search space rapidly. As a result, our method gives the decreased tuning time and access latency.

Uncertain Region Based User-Assisted Segmentation Technique for Object-Based Video Editing System (객체기반 비디오 편집 시스템을 위한 불확실 영역기반 사용자 지원 비디오 객체 분할 기법)

  • Yu Hong-Yeon;Hong Sung-Hoon
    • Journal of Korea Multimedia Society
    • /
    • v.9 no.5
    • /
    • pp.529-541
    • /
    • 2006
  • In this paper, we propose a semi-automatic segmentation method which can be used to generate video object plane (VOP) for object based coding scheme and multimedia authoring environment. Semi-automatic segmentation can be considered as a user-assisted segmentation technique. A user can initially mark objects of interest around the object boundaries and then the selected objects are continuously separated from the un selected areas through time evolution in the image sequences. The proposed segmentation method consists of two processing steps: partially manual intra-frame segmentation and fully automatic inter-frame segmentation. The intra-frame segmentation incorporates user-assistance to define the meaningful complete visual object of interest to be segmentation and decides precise object boundary. The inter-frame segmentation involves boundary and region tracking to obtain temporal coherence of moving object based on the object boundary information of previous frame. The proposed method shows stable and efficient results that could be suitable for many digital video applications such as multimedia contents authoring, content based coding and indexing. Based on this result, we have developed objects based video editing system with several convenient editing functions.

  • PDF

A Group Update Technique based on a Buffer Node to Store a Vehicle Location Information (차량 위치 정보 저장을 위한 버퍼 노드 기반 그룹 갱신 기법)

  • Jung, Young-Jin;Ryu, Keun-Ho
    • Journal of KIISE:Databases
    • /
    • v.33 no.1
    • /
    • pp.1-11
    • /
    • 2006
  • It is possible to track the moving vehicle as well as to develop the location based services actively according to the progress of wireless telecommunication and GPS, to the spread of network, and to the miniaturization of cellular phone. To provide these location based services, it is necessary for an index technique to store and search too much moving object data rapidly. However the existing indices require a lot of costs to insert the data because they store every position data into the index directly. To solve this problem in this paper, we propose a buffer node operation and design a GU-tree(Group Update tree). The proposed buffer node method reduces the input cost effectively since the operation stores the moving object location data in a group, the buffer node as the unit of a non-leaf node. hnd then we confirm the effect of the buffer node operation which reduces the insert cost and increase the search performance in a time slice query from the experiment to compare the operation with some existing indices. The proposed tufter node operation would be useful in the environment to update locations frequently such as a transportation vehicle management and a tour-guide system.

Acquisition of Region of Interest through Illumination Correction in Dynamic Image Data (동영상 데이터에서 조명 보정을 사용한 관심 영역의 획득)

  • Jang, Seok-Woo
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.22 no.3
    • /
    • pp.439-445
    • /
    • 2021
  • Low-cost, ultra-high-speed cameras, made possible by the development of image sensors and small displays, can be very useful in image processing and pattern recognition. This paper introduces an algorithm that corrects irregular lighting from a high-speed image that is continuously input with a slight time interval, and which then obtains an exposed skin color region that is the area of interest in a person from the corrected image. In this study, the non-uniform lighting effect from a received high-speed image is first corrected using a frame blending technique. Then, the region of interest is robustly obtained from the input high-speed color image by applying an elliptical skin color distribution model generated from iterative learning in advance. Experimental results show that the approach presented in this paper corrects illumination in various types of color images, and then accurately acquires the region of interest. The algorithm proposed in this study is expected to be useful in various types of practical applications related to image recognition, such as face recognition and tracking, lighting correction, and video indexing and retrieval.

Implementation of an Efficient Microbial Medical Image Retrieval System Applying Knowledge Databases (지식 데이타베이스를 적용한 효율적인 세균 의료영상 검색 시스템의 구현)

  • Shin Yong Won;Koo Bong Oh
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.1 s.33
    • /
    • pp.93-100
    • /
    • 2005
  • This study is to desist and implement an efficient microbial medical image retrieval system based on knowledge and content of them which can make use of more accurate decision on colony as doll as efficient education for new techicians. For this. re first address overall inference to set up flexible search path using rule-base in order U redure time required original microbial identification by searching the fastest path of microbial identification phase based on heuristics knowledge. Next, we propose a color ffature gfraction mtU, which is able to extract color feature vectors of visual contents from a inn microbial image based on especially bacteria image using HSV color model. In addition, for better retrieval performance based on large microbial databases, we present an integrated indexing technique that combines with B+-tree for indexing simple attributes, inverted file structure for text medical keywords list, and scan-based filtering method for high dimensional color feature vectors. Finally. the implemented system shows the possibility to manage and retrieve the complex microbial images using knowledge and visual contents itself effectively. We expect to decrease rapidly Loaming time for elementary technicians by tell organizing knowledge of clinical fields through proposed system.

  • PDF

An Index Structure for Substructure Searching In Chemical Databases (화학 데이타베이스에서 부분구조 검색을 위한 인덱스 구조)

  • Lee Hwangu;Cha Jaehyuk
    • Journal of KIISE:Databases
    • /
    • v.31 no.6
    • /
    • pp.641-649
    • /
    • 2004
  • The relationship between chemical structures and biological activities is researched briskly in the area of 'Medicinal Chemistry' At the base of these structure-based drug design tries, medicinal chemists search the existing drugs of similar chemical structure to target drug for the development of a new drug. Therefore, it is such necessary that an automatic system selects drug files that have a set of chemical moieties matching a user-defined query moiety. Substructure searching is the process of identifying a set of chemical moieties that match a specific query moiety. Testing for substructure searching was developed in the late 1950s. In graph theoretical terms, this problem corresponds to determining which graphs in a set are subgraph isomorphic to a specified query moiety. Testing for subgraph isomorphism has been proved, in the general case, to be an NP- complete problem. For the purpose of overcoming this difficulty, there were computational approaches. On the 1990s, a US patent has been granted on an atom-centered indexing scheme, used by the RS3 system; this has the virtue that the indexes generated can be searched by direct text comparison. This system is commercially used(http://www.acelrys.com/rs3). We define the RS3 system's drawback and present a new indexing scheme. The RS3 system treats substructure searching with substring matching by means of expressing chemical structure aspredefined strings. However, it has insufficient 'rerall' and 'precision‘ because it is impossible to index structures uniquely for same atom and same bond. To resolve this problem, we make the minimum-cost- spanning tree for one centered atom and describe a structure with paths per levels. Expressing 2D chemical structure into 1D a string has limit. Therefore, we break 2D chemical structure into 1D structure fragments. We present in this paper a new index technique to improve recall and precision surprisingly.

A Multi-dimensional Range Query Processing using Space Filling Curves (공간 순서화 곡선을 이용한 다차원 영역 질의 처리)

  • Back, Hyun;Won, Jung-Im;Yoon, Jee-Hee
    • Journal of Korea Spatial Information System Society
    • /
    • v.8 no.2 s.17
    • /
    • pp.13-38
    • /
    • 2006
  • Range query is one of the most important operations for spatial objects, it retrieves all spatial objects that overlap a given query region in multi-dimensional space. The DOT(DOuble Transformation) is known as an efficient indexing methods, it transforms the MBR of a spatial object into a single numeric value using a space filling curve, and stores the value in a $B^+$-tree. The DOT index is possible to be employed as a primary index for spatial objects. However, the range query processing based on the DOT index requires much overhead for spatial transformations to get the query region in the final space. Also, the detailed range query processing method for 2-dimensional spatial objects has not been studied yet in this paper, we propose an efficient multi-dimensional range query processing technique based on the DOT index. The proposed technique exploits the regularities in the moving patterns of space filling curves to divide a query region into a set of maximal sub-legions within which space filling curves traverse without interruption. Such division reduces the number of spatial transformations required to perform the range query and thus improves the performance of range query processing. A visual simulator is developed to show the evaluation method and the performance of our technique.

  • PDF

Range Stabbing Technique for Continuous Queries on RFID Streaming Data) (RFID 스트리밍 데이타의 연속질의를 위한 영역 스태빙 기법)

  • Park, Jae-Kwan;Hong, Bong-Hee;Lee, Ki-Han
    • Journal of KIISE:Databases
    • /
    • v.36 no.2
    • /
    • pp.112-122
    • /
    • 2009
  • The EPCglobal leading the development in RFID standards proposed Event Cycle Specification (ECSpec) and Event Cycle Reports (ECReports) for the standard about RFID middleware interface. ECSpec is a specification for filtering and collecting RFID tag data and is treated as a Continuous Query (CQ) processed during fixed time intervals repeatedly. ECReport is a specification for describing the results after ECSpec is processed. Thus, it is efficient to apply Query Indexing technique designed for the continuous query processing. This query index processes ECSpecs as data and tag events as queries for efficiency. In logistics environment, the similar or same products are transferred together. Also, when RFID tags attached to the products are acquired, the acquisition events occur massively for the short period. For these properties, it is inefficient to process the massive events one by one. In this paper, we propose a technique reducing similar search process by considering tag events which are collected by the report period in ECSpec, as a range query. For this group processing, we suggest a queuing method for collecting tag events efficiently and a structure for generating range queries in the queues. The experiments show that performance is enhanced by the proposed methods.