• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.10
• /
• pp.1862-1878
• /
• 2011

With the advances in wireless communication technology and the advent of smartphones, research on location-based services (LBSs) is being actively carried out. In particular, several spatial index methods have been proposed to provide efficient LBSs. However, finding an optimal indexing method that balances query performance and index size remains a challenge in the case of wireless environments that have limited channel bandwidths and device resources (computational power, memory, and battery power). Thus, mechanisms that make existing spatial indexing techniques more efficient and highly applicable in resource-limited environments should be studied. Bitmap-based Spatial Indexing (BSI) has been designed to support LBSs, especially in wireless broadcast environments. However, the access latency in BSI is extremely large because of the large size of the bitmap, and this may lead to increases in the search time. In this paper, we introduce a Selective Bitmap-based Spatial Indexing (SBSI) technique. Then, we propose an Adaptive Bitmap-based Spatial Indexing (ABSI) to improve the tuning time in the proposed SBSI scheme. The ABSI is applied to the distribution of geographical objects in a grid by using the Hilbert curve (HC). With the information in the ABSI, grid cells that have no objects placed, (i.e., 0-bit information in the spatial bitmap index) are not tuned during a search. This leads to an improvement in the tuning time on the client side. We have carried out a performance evaluation and demonstrated that our SBSI and ABSI techniques outperform the existing bitmap-based DSI (B DSI) technique.

• Journal of Platform Technology
• /
• v.9 no.4
• /
• pp.3-9
• /
• 2021

In this paper, a graph data model is introduced to effectively recognize the situation between each object on the road detected by vehicles or road infrastructure sensors. The proposed method builds a graph database by modeling each object on the road as a node of the graph and the relationship between objects as an edge of the graph, and updates object properties and edge properties in real time. In this case, the relationship between objects represented as edges is set when there is a possibility of approach between objects in consideration of the position, direction, and speed of each object. Finally, we propose a spatial indexing technique for graph nodes and edges to update the road object graph database represented through the proposed graph modeling method continuously in real time. To show the superiority of the proposed indexing technique, we compare the proposed indexing based database update method to the non-indexing update method through simulation. The results of the simulation show the proposed method outperforms more than 10 times to the non-indexing method.

• Journal of Internet Computing and Services
• /
• v.6 no.4
• /
• pp.59-73
• /
• 2005

Caching query results and reusing them in processing of subsequent queries is an important query optimization technique. Materialized view and view indexing are the representative examples of such a technique. The two schemes had received much attention for relational databases, and have been investigated for XML data since XML emerged as the standard for data exchange on the Web. In XML view indexing, XML view xv which is the result of an XML query is represented as an XML view index(XVI), a structure containing the identifiers of xv's underlying XML elements as well as the information on xv. Since XVI for xv stores just the identifiers of the XML elements not the elements themselves, when xv is requested, its XVI should be materialized against xv's underlying XML documents. In this paper, we address the problem of integrating an XML view index management system with an RDBMS based XML storage system. The proposed system was implemented in Java on Windows 2000 Server with each of two different commercial RDBMSs, and used in evaluating performance improvement through XML view indexing as well as its overheads. The experimental results revealed that XML view indexing was very effective with an RDBMS based XML storage system while its overhead was negligible.

• The KIPS Transactions:PartD
• /
• v.13D no.3 s.106
• /
• pp.317-324
• /
• 2006

In this paper, we propose a new indexing technique to solve various queries which have a strong good point not only database indexing schema take advantage of converting from semi-structured data to structured data but also performance is more faster than before. We represent structure information of XML document between nodes of tree that additional numbering information which can be bit-stream without modified structure of XML tree. And, We add in indexing schema searching incidental structure information in the process. In Querying schema, we recover ancestor nodes through give information of node using indexing schema in complete path query expression as well as relative path query expression. Therefore, it takes advantage of making derivative query expression with given query. In this process, we recognize that indexing and querying schema can get searched result set faster and more accurate. Because response time is become shorter by bit operating, when query occur and it just needs information of record set earch node in database.

• Journal of Industrial Technology
• /
• v.20 no.B
• /
• pp.207-211
• /
• 2000

For efficient massive image retrieval, an image retrieval requires that several important objectives are satisfied, namely: automated extraction of features, efficient indexing and effective retrieval. In this work, we present a technique for extracting the 4-dimension directional feature. By directional detail, we imply strong directional activity in the horizontal, vertical and diagonal direction present in region of the image texture. This directional information also present smoothness of region. The 4-dimension feature is only indexed in the 4-D space so that complex high-dimensional indexing can be avoided.

• The KIPS Transactions:PartD
• /
• v.11D no.7 s.96
• /
• pp.1409-1416
• /
• 2004

Recently, due to the popularity and explosive growth of the Internet, information exchange is increasing dramatically over the Internet. Also the XML is becoming a standard as well as a major tool of data exchange on the Internet. so that in retrieving the XML document. the problem for speeding up evaluation of path-oriented queries is a main issue. In this paper, we propose a new indexing technique to advance the searching performance of path-oriented queries in document databases. In the new indexing technique, an abbreviation-path file to perform path-oriented queries efficiently is generated which is able to use its hash-code value to index keys. Also this technique can be further enhanced by combining the Extendible Hashing technique with the abbreviation path file to expedite a speed up evaluation of retrieval.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.2 no.3
• /
• pp.150-170
• /
• 2008

In recent years, main focus of research on image retrieval techniques is on content-based image retrieval. Text-based image retrieval schemes, on the other hand, provide semantic support and efficient retrieval of matching images. In this paper, based on Formal Concept Analysis (FCA), we propose a new image indexing and retrieval technique. The proposed scheme uses keywords and textual annotations and provides semantic support with fast retrieval of images. Retrieval efficiency in this scheme is independent of the number of images in the database and depends only on the number of attributes. This scheme provides dynamic support for addition of new images in the database and can be adopted to find images with any number of matching attributes.

• The Journal of the Acoustical Society of Korea
• /
• v.20 no.2
• /
• pp.16-20
• /
• 2001

An important aspect of video program indexing and retrieval is the ability to segment video program into meaningful segments, in other words, the ability of content-based video program segmentation. In this paper, a new approach using speech recognition technology has been proposed for content-based video program segmentation. This approach uses speech recognition technique to synchronize closed caption with speech signal. Experimental results demonstrate that the proposed scheme is very promising for content-based video program segmentation.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04b
• /
• pp.10-12
• /
• 2004

Nowadays, with the rapid emergence of XML as a standard for data exchange over the Internet had led to considerable interest In the problem of data management requirements such as the need to store and query XML documents in which the location path languages Xpath is of particular important for XML application since it is a core component of many XML processing standards such as XSLT or XQuery, This parer gives a brief overview about method and design by applying a new spatial-based indexing method namely Xp-free that used for supporting Xpath. Spatial indexing technique has been proved its capacity on searching in large databases. Based on accelerating a node using planar as combined with the numbering schema, we devise efficiently derivative algorithms, which are simple, but useful. Besides that, it also allows to trace all Its relative nodes of context node In a manner supporting queries natural to the types especially Xpath queries with predicates.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.05a
• /
• pp.898-899
• /
• 2013

There are numerous approaches to improve the performances of database systems. The most efficient ones are considered to be implementing an effective database indexing technique. This must guarantee the balance between the memory, storage resources and processor of the database server according to the type, structure, the physical organization and the cardinality of data, the type of queries and the number of competing transactions. The challenge is to find an appropriate index type that would suite these requirements. In this paper, we provide an overview of the most used database indexing techniques such as B-tree index and Bitmap index, present an analysis of these techniques and discuss their limitations.