• Journal of the Korean Society for information Management
• /
• v.21 no.2
• /
• pp.235-248
• /
• 2004

For the users of information retrieval systems, natural language query is the more ideal interface, compared with keyword and boolean expressions. This paper proposes a retrieval technique with expanded keyword from syntactically-analyzed structures of natural language query as user input. Through the steps combining or splitting the compound nouns based on syntactic tree traversal of the query, and expanding the other-formed or shorten-formed into multiple keyword, it can enhance the precision and correctness of the retrieval system.

• Journal of Korea Multimedia Society
• /
• v.9 no.3
• /
• pp.307-314
• /
• 2006

This paper proposes a QT_rev algorithm for identifying multiple tags. The proposed QT_rev algorithm is based on the query tree algorithm. In the algorithm, the tag will send all the bits of their identification codes when the query string matches the first bits of their identification codes. On the other hand, in the QT_rev algorithm, the tag will send the remaining bits of their identification codes. After the leader receives all the responses of the tags, it knows which bit is collided. Therefore, if the collision occurs in the last bit, the reader can identify two tags simultaneously without further query. According to the simulation results, the QT_rev algorithm outperforms the QT algorithm in terms of the number of queries and the number of response bits.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.11a
• /
• pp.413-416
• /
• 2008

In the presence of multiple continuous queries, multi-query optimizing is a new challenge to process multiple stream data in real-time. So, in this paper, we proposed an approach to optimize multi-query of sliding window on network traffic data streams and do some comparisons to traditional queries without optimizing. We also detail some method of scheduling on different data streams, while different scheduling made different results. We test the results on variety of multi-query processing schedule, and proofed the proposed method is effectively optimized the data stream similar multi-queries.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.4 no.2
• /
• pp.103-110
• /
• 2011

It is necessary to accurate and efficient management for measured digital data from sensors in u-health system. It is not efficient that sensor network process input stream data of mass storage stored in database the same time. We propose to improve the processing performance of multidimensional stream data continuous incoming from multiple sensor. We propose process query based on sliding window for efficient input stream and found multiple query plan to Mjoin method and we reduce stored data using backpropagation algorithm. As a result, we obtained to efficient result about 18.3% reduction rate of database using 14,324 data sets.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.6
• /
• pp.109-117
• /
• 2016

The most important mission of RFID reader is identify EPC (Electronic Product Code) of RFID tag of products that located within distinguishable range of RFID reader. RFID reader transmits query message to RFID tags through wireless channel and RFID tags send unique EPC to response its query message simultaneously. therefore tag collision occurred frequently. RFID tags collision resolution algorithm required to apply RFID technology to various industries. In this paper, we propose enhanced M-ary algorithm that collision bits location is used by not only RFID reader but also tags. the main feature of the proposed algorithm is that integrate multiple query message of M-ary QT algorithm to the single query message by analyze multiple response messages from tags. the simulation results show that the proposed algorithm give better performance than M-ary QT algorithm in terms of the number of query-response, identification efficiency and communication overhead.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.6
• /
• pp.165-175
• /
• 2016

A data allocation technique is essential to improve the performance of data broadcast systems. This paper explores the issues for allocating data items on broadcast channels to process multiple-data queries in the environment where query profiles and query request rates are given, and proposes a new data allocation scheme named QBDA. The proposed scheme allows the query with higher request rate to have higher priority to schedule its data items and introduces the concept of marking to reduce data conflicts. Simulation is performed to evaluate the performance of QBDA. The simulation results show that the proposed scheme outperforms other schemes in terms of the average response time since it can process queries with high request rate fast and show a very desirable characteristics in the aspects of query data adjacency and data conflict probability.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.4
• /
• pp.1-12
• /
• 2009

An RFID application needs to collect product's information scattered over the RFID network efficiently according to the globalization of RFID applied enterprises. To be informed of the stock status of products promptly in the supply chain network, especially, it is necessary to support queries that retrieve statistical information of tagged products. Since existing RFID network does not provide these kinds of queries, however, an application should request a query to several RFID middleware systems and analyze collected data directly. This process makes an application do a heavy computation for retrieving statistical information. To solve this problem, we define a new Distributed Continuous Query that finds information of tagged products from the global RFID network and provides statistical information to RFID applications. We also propose a Distributed Continuous Query System to process the distributed continuous query efficiently. To find out the movement of products via multiple RFID systems in real time, our proposed system uses Pedigree which represents trade information of items. Our system can also reduce the cost of query processing for removing duplicated data from multiple middleware systems by using Pedigree.

• The Journal of Society for e-Business Studies
• /
• v.15 no.4
• /
• pp.165-179
• /
• 2010

Recently, the processing of data streams such as stock quotes, buy-sell orders, and billing records becomes more important in e-Business environments. Especially, the use of skyline queries over data streams is rapidly increasing to support multiple criteria decision making. Given a set of multi-dimensional tuples, a skyline query retrieves a set of tuples which are not dominated by other tuples. Although there has been much work on processing skyline queries over static datasets, there has been relatively less work on processing multiple skyline queries over data streams. In this paper, we propose an efficient method for processing multiple continuous skyline queries over data streams. The proposed method efficiently identifies which tuple is a skyline tuple of which query, resulting in a lower cost of processing multiple skyline queries. Through performance evaluation, we show the performance advantage of the proposed method.

• The KIPS Transactions:PartD
• /
• v.14D no.5
• /
• pp.459-470
• /
• 2007

A data stream is a massive unbounded sequence of data elements continuously generated at a rapid rate. Query processing for such a data stream should also be continuous and rapid, which requires strict time and space constraints. In most DSMS(Data Stream Management System), the selection predicates of continuous queries are grouped or indexed to guarantee these constraints. This paper proposes a new scheme tailed an ASC(Attribute Selection Construct) that collectively evaluates selection predicates containing the same attribute in multiple continuous queries. An ASC contains valuable information, such as attribute usage status, partially pre calculated matching results and selectivity statistics for its multiple selection predicates. The processing order of those ASC's that are corresponding to the attributes of a base data stream can significantly influence the overall performance of multiple query evaluation. Consequently, a method of establishing an efficient evaluation order of multiple ASC's is also proposed. Finally, the performance of the proposed method is analyzed by a series of experiments to identify its various characteristics.

• The KIPS Transactions:PartD
• /
• v.14D no.6
• /
• pp.585-596
• /
• 2007

XML data generally consists of a hierarchical tree-structure which is reflected in mechanisms to store and retrieve XML data. Therefore, when storing XML data in the database, the hierarchical relationships among the XML elements are taken into consideration during the restructuring and storing of the XML data. Also, in order to support the search queries from the user, a mechanism is needed to compute the hierarchical relationship between the element structures specified by the query. The structural join operation is one solution to this problem, and is an efficient computation method for hierarchical relationships in an in database based on the node numbering scheme. However, in order to process a tree structured XML query which contains a complex nested hierarchical relationship it still needs to carry out multiple structural joins and results in another problem of having a high query execution cost. Therefore, in this paper we provide a preprocessing mechanism for effectively reducing the cost of multiple nested structural joins by applying the concept of equivalence classes and suggest a query path reduction algorithm to shorten the path query which consists of a regular expression. The mechanism is especially devised to reduce path queries containing branch nodes. The experimental results show that the proposed algorithm can reduce the time requited for processing the path queries to 1/3 of the original execution time.