• International Journal of Contents
• /
• v.1 no.1
• /
• pp.6-9
• /
• 2005

In this paper, we propose a novel approach of user interface for querying Digital Video Library. Through the proposed user interface, the users can specify the query more easily and precisely for image and video retrieval, resulting in better retrieval accuracy of the system. The prototype of the proposed system allows specification of character, atmosphere, implement, mapping and event for the query. This prototype not only provides users with the convenience of query specification in various aspects, but also can easily be extended to the retrieval systems of various multimedia data.

• Journal of the Korean BIBLIA Society for library and Information Science
• /
• v.14 no.1
• /
• pp.219-230
• /
• 2003

The purpose of this study is to improve of retrieval effectiveness to clustered and filtered document through query expansion. The result of this research prove that extended queries and documents, information in encyclopedia, clustering and filtering techniques are effective to promote retrieval effectiveness.

• The KIPS Transactions:PartD
• /
• v.9D no.3
• /
• pp.381-388
• /
• 2002

XML documents, which are becoming new standard for expressing and exchanging data in the Internet, don't have defined schema. It is not adequate to directly apply XML documents to the existing SQL or OQL. Research on how to extract Schema for XML documents and query language is going on actively. For users' query, the results could be too tony or too less. It Is important to give the users adequate results. This paper suggests the way to extract many levelized schema according to the frequency of element occurrence in XML documents. The Schema can be reduced or extended to correspond to the users' query more flexibly.

• Journal of KIISE:Databases
• /
• v.33 no.7
• /
• pp.668-681
• /
• 2006

Due to its diverse advantages, XML has secured its position as a standard for data representation and exchange in the Internet. As a consequence, there has been much research on efficient storing and query processing of in data. Storing XML data in a relational database system warrants much benefit in data management and query processing; the system provides a strong query processing and data management function and can be applicable to XML data, its function being extended. In this paper, we design and implement a query translator that translates XQuery, a representative XML query language, into SQL:2003 query. SQL:2003, the latest SQL standard used as a substitute for SQL:1999, defines SQL/XML that supports XML. The main contribution of this paper is as follows: First, we look into the supporting features of XML, defined in the SQL:2003 standard, and propose a user-defined function for shortcoming sections. Second, we propose a way to translate XQuery into SQL that observes the latest SQL standard. Third, we describe in detail the design and the implementation of the translator to show its feasibility as a translator.

• Journal of KIISE:Databases
• /
• v.37 no.4
• /
• pp.185-196
• /
• 2010

Existing methods to compute reverse skyline queries are not correct to process the queries in dataset with region objects which have conditions like a price is 5~7 dollars and a distance to beach is 1km~2km, since they consider datasets with only point objects. To solve the problem, we propose a novel method to process reverse skyline queries for region objects in this paper. It has advantages. First, it is expected to get a good performance, because it is extended from efficient reverse skyline (ERSL) algorithm which is a best algorithm to computing reverse skyline queries in datasets with point objects. Second, it can give a right of choice unlike the others to a person requesting the query. That is because results of reverse skyline have a difference preference according to proposed pruning methods and overlap relations. This algorithm is a first for supporting region objects. Therefore there are not any other algorithms to compare their performance. For that reason, our experiment to prove the efficiency of proposed algorithm is focused what conditions give an effect to its performance and result and how much time it needs to process the query.

• KIISE Transactions on Computing Practices
• /
• v.20 no.12
• /
• pp.682-687
• /
• 2014

First phoneme queries are important functionalities that provide an improvement in the usability of interfaces that produce errors frequently due to their restricted input environment, such as in navigators and mobile devices. In this paper, we propose a time-space efficient data structure for Korean first phoneme queries that disassembles Korean strings in a phoneme-wise manner, rearranges them into circular strings, and finally, indexes them using the extended Burrows-Wheeler Transform. We also demonstrate that our proposed method can process more types of query using less space than previous methods. We also show it can improve the search time when the query length is shorter and the proportion of first phonemes is higher.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.9
• /
• pp.2057-2064
• /
• 2010

With the development of wireless network technology, the location information of a spatiotemporal object which changes their location is used in various application. Each spatiotemporal object has many location information, hence it is inefficient to search all trajectory information of spatiotemporal objects for a range query. In this paper, we propose an efficient method which divides a trajectory and stores its division data on restricted storage space. Using suboptimal split algorithm, an extended split algorithm that minimizes the volume of EMBRs(Extended Minimum Bounding Box) is designed and simulated. Our experimental evaluation confirms the effectiveness and efficiency of our proposed splitting policy

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.3
• /
• pp.894-907
• /
• 2022

The features extracted by convolutional neural networks are more descriptive of images than traditional features, and their convolutional layers are more suitable for retrieving images than are fully connected layers. The convolutional layer features will consume considerable time and memory if used directly to match an image. Therefore, this paper proposes a feature weighting and region integration method for convolutional layer features to form global feature vectors and subsequently use them for image matching. First, the 3D feature of the last convolutional layer is extracted, and the convolutional feature is subsequently weighted again to highlight the edge information and position information of the image. Next, we integrate several regional eigenvectors that are processed by sliding windows into a global eigenvector. Finally, the initial ranking of the retrieval is obtained by measuring the similarity of the query image and the test image using the cosine distance, and the final mean Average Precision (mAP) is obtained by using the extended query method for rearrangement. We conduct experiments using the Oxford5k and Paris6k datasets and their extended datasets, Paris106k and Oxford105k. These experimental results indicate that the global feature extracted by the new method can better describe an image.

• The KIPS Transactions:PartD
• /
• v.17D no.2
• /
• pp.129-146
• /
• 2010

Nowadays, XML has been favored by many companies internally and externally as a means of sharing and distributing data. there are many researches and systems for modeling and storing XML documents by an object-oriented method as for the method of saving and managing web-based multimedia document more easily. The representative tool for the object-oriented modeling of XML documents is UML (Unified Modeling Language). UML at the beginning was used as the integrated methodology for software development, but now it is used more frequently as the modeling language of various objects. Currently, UML supports various diagrams for object-oriented analysis and design like class diagram and is widely used as a tool of creating various database schema and object-oriented codes from them. This paper proposes an Efficinet Query Modelling of XML-GL using the UML class diagram and OCL for searching XML document which its application scope is widely extended due to the increased use of WWW and its flexible and open nature. In order to accomplish this, we propose the modeling rules and algorithm that map XML-GL. which has the modeling function for XML document and DTD and the graphical query function about that. In order to describe precisely about the constraint of model component, it is defined by OCL (Object Constraint Language). By using proposed technique creates a query for the XML document of holding various properties of object-oriented model by modeling the XML-GL query from XML document, XML DTD, and XML query while using the class diagram of UML. By converting, saving and managing XML document visually into the object-oriented graphic data model, user can prepare the base that can express the search and query on XML document intuitively and visually. As compared to existing XML-based query languages, it has various object-oriented characteristics and uses the UML notation that is widely used as object modeling tool. Hence, user can construct graphical and intuitive queries on XML-based web document without learning a new query language. By using the same modeling tool, UML class diagram on XML document content, query syntax and semantics, it allows consistently performing all the processes such as searching and saving XML document from/to object-oriented database.

• Spatial Information Research
• /
• v.19 no.2
• /
• pp.47-56
• /
• 2011

Typical tree-based spatial index structures are divided into a data-partitioning index structure such as R-Tree and a space-partitioning index structure such as KD-Tree. In recent years, researches on hybrid index structures combining advantages of these index structures have been performed extensively. However, because the split boundary extension of the node to which a new spatial object is inserted may extend split boundaries of other neighbor nodes in existing researches, overlaps between nodes are increased and the query processing cost is raised. In this paper, we propose a hybrid index structure, called SQR-Tree that can support efficient processing of spatial queries to solve these problems. SQR-Tree is a combination of SQ-Tree(Spatial Quad- Tree) which is an extended Quad-Tree to process non-size spatial objects and R-Tree which actually stores spatial objects associated with each leaf node of SQ-Tree. Because each SQR-Tree node has an MBR containing sub-nodes, the split boundary of a node will be extended independently and overlaps between nodes can be reduced. In addition, a spatial object is inserted into R-Tree in each split data space and SQ-Tree is used to identify each split data space. Since only R-Trees of SQR-Tree in the query area are accessed to process a spatial query, query processing cost can be reduced. Finally, we proved superiority of SQR-Tree through experiments.