• Journal of KIISE:Databases
• /
• v.32 no.5
• /
• pp.473-486
• /
• 2005

The Hippocratic database model recently proposed by Agrawal et at. incorporates privacy protection capabilities into relational databases. The authors have subsequenty proposed the Hippocratic XML daかabase model[4], an extension of the Hippocratic database model for XML databases. In this paper, we propose a new concept that we cail the dynamic predicate(DP) for effective access control in the Hippocratic XML database model. A DP is a novel concept that represents a dynamically constructed rendition that tan be adapted for determining the accessibility of elements during query execution. DPs allow us to effectively integrate authorization checking into the query plan so that unauthorized elements are excluded in the process of query execution. Using synthetic and real data, we have performed extensive experiments comparing query processing time with those of existing access control mechanisms. The results show that the proposed access control mechanism improves the wall clock time by up to 219 times over the top-down access control strategy and by up to 499 times over the bottom-up access control strategy. The major contribution of our, paper is enabling effective integration of access control mechanisms with the query plan using the DP under the Hippocratic XML database model.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.5 s.43
• /
• pp.127-137
• /
• 2006

We propose two phase filtering scheme to develop an efficient mechanism for XML databases to control query-based access. An access control environment for XML documents and some techniques to deal with fine-grained authorization priorities and conflict resolution issues are proposed. Despite this, relatively little work has been done to enforce access controls particularly for XML databases in the case of query-based access. The basic idea utilized is that a user query interaction with only necessary access control rules is modified to an alternative form through a query optimization technique, which is guaranteed to have no access violations using tree-aware metadata of XML schemas. The scheme can be applied to any XML database management system and has several advantages such as small execution time overhead, fine-grained controls, and safe and correct query modification. The experimental results clearly demonstrate the efficiency of the approach.

• Journal of KIISE:Databases
• /
• v.34 no.1
• /
• pp.1-17
• /
• 2007

As XML is becoming a de facto standard for distribution and sharing of information, the need for an efficient yet secure access of XML data has become very important. To enforce the fine-level granularity requirement, authorization models for regulating access to XML documents use XPath which is a standard for specifying parts of XML data and a suitable language for both query processing. An access control environment for XML documents and some techniques to deal with authorization priorities and conflict resolution issues are proposed. Despite this, relatively little work has been done to enforce access controls particularly for XML databases in the case of query access. Developing an efficient mechanism for XML databases to control query-based access is therefore the central theme of this paper. This work is a proposal for an efficient yet secure XML access control system. The basic idea utilized is that a user query interaction with only necessary access control rules is modified to an alternative form which is guaranteed to have no access violations using tree-aware metadata of XML schemes and set operators supported by XPath 2.0. The scheme can be applied to any XML database management system and has several advantages over other suggested schemes. These include implementation easiness, small execution time overhead, fine-grained controls, and safe and correct query modification. The experimental results clearly demonstrate the efficiency of the approach.

• Journal of KIISE:Information Networking
• /
• v.29 no.2
• /
• pp.197-203
• /
• 2002

This paper proposes a new agent based mechanism called a Multicast Handoff Agent (MHA) to reduce handoff latency for IP multicast. The MHA acts as a proxy for an Internet Group Management Protocol (IGMP) of Mobile Nodes (MNs) at each Base Station (BS) and keeps information for members of multicast groups in a cell. When an MN moves to a next cell, the MHA immediately sends unsolicited reports without waiting for the IGMP query. The mechanism was evaluated through simulation and analysis and compared with the IGMPv2 for micro-mobility and the IGMP traffic. Simulation results show that handoff latency for micro-mobility can be largely reduced and the IGMP control traffic on the wireless links during the duration of membership can be eliminated. Thus, this mechanism is superior to the existing mechanism in both micro-mobility and battery duration, as the need not to reply to a query conserves battery power.

• The KIPS Transactions:PartC
• /
• v.11C no.3
• /
• pp.293-300
• /
• 2004

Ad hoc networks are groups of mobile hosts without any fixed infrastructure. Frequent changes in network topology owing to node mobility make these networks very difficult to manage. Therefore, enhancing the reliability of routing paths in ad hoc networks gets more important. In this paper, we propose a ZRP(Zone Routing Protocol)-based route discovery scheme that can not only reduce the total hops of routing path, but Improve security through authentications between two nodes. And to solve the problem in maintenance of routing paths owing to frequent changes of the network topology, we adopt a query control mechanism. The effectiveness of our scheme is shown by simulation methods.

• Asia pacific journal of information systems
• /
• v.7 no.3
• /
• pp.23-37
• /
• 1997

Although numerous models and solution algorithms to design efficient distributed databases have been developed, very few have been validated for their effectiveness. In this paper, we develop a simulation system which can be used to analyze and validate the average response time of distributed database designs. Our simulation system models comprehensive query processing strategies such as semijoin as well as a concurrency control mechanism We analyze and validate an average response time distributed database design model using our simulation system.

• Journal of KIISE:Databases
• /
• v.31 no.6
• /
• pp.684-698
• /
• 2004

The Hippocratic database model recently proposed by Agrawal et al. incorporates privacy protection capabilities into relational databases. Since the Hippocratic database is based on the relational database, it needs extensions to be adapted for XML databases. In this paper, we propose the Hippocratic XML database model, an extension of the Hippocratic database model for XML databases and present an efficient access control mechanism under this model. In contrast to relational data, XML data have tree-like hierarchies. Thus, in order to manage these hierarchies of XML data, we extend and formally define such concepts presented in the Hippocratic database model as privacy preferences, privacy policies, privacy authorizations, and usage purposes of data records. Next, we present a new mechanism, which we call the authorization index, that is used in the access control mechanism. This authorization index, which is Implemented using a multi-dimensional index, allows us to efficiently search authorizations implied by the authorization granted on the nearest ancestor using the nearest neighbor search technique. Using synthetic and real data, we have performed extensive experiments comparing query processing time with those of existing access control mechanisms. The results show that the proposed access control mechanism improves the wall clock time by up to 13.6 times over the top-down access control strategy and by up to 20.3 times over the bottom-up access control strategy The major contributions of our paper are 1) extending the Hippocratic database model into the Hippocratic XML database model and 2) proposing an efficient across control mechanism that uses the authorization index and nearest neighbor search technique under this model.

• Journal of KIISE:Databases
• /
• v.30 no.1
• /
• pp.41-51
• /
• 2003

The spatiotemporal database concerns about the time-varying spatial attributes. One of the important research areas is related to the support of various location-based services in motile communication environments. It is known that database systems may be difficult to manage the accurate geometric locations of moving objects due to their continual changes of locations. However, this requirement is necessary in various spatiotemporal applications including mobile communications, traffic control and military command and control (C2) systems. In this paper we propose the $B^{st}$-tree that utilizes the concept of multi-version B-trees. It provides an indexing method (or the historical and future range query Processing on moving object's trajectories. Also we present a dynamic version management algorithm that determines the appropriate version evolution induced by the mobility patterns to keep the query performance. With experiments we .;hi)w that our indexing approach is a viable alternative in this area.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.5 no.2
• /
• pp.193-204
• /
• 2010

Since Wireless Multimedia Sensor Network(WMSN) needs to process various multimedia data such as audio, image and video data as well as scalar data, it requires a mechanism that can support Quality of Service(QoS) to handle efficiently. This paper classifies traffic in WMSN as periodic monitoring traffic, event traffic, multimedia traffic and query-based traffic, proposes marking algorithm and queue management mechanism that guarantee differentiated QoS in terms of delay, energy efficiency and credibility on each traffic and conduct performance analysis with simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.5B
• /
• pp.253-263
• /
• 2005

This paper proposed a mobile multicast technique to satisfy end-to-end QoS for various user requirements in mobile network environment. In order to provide seamless mobility, fast handoff technique was applied. By using L2 mobile trigger, it was possible to minimize remarkable amount of packet loss by delay occurred during handoff. To provide efficient multicast, concept of hierarchy was introduced to Xcast++, which results in a creation of HXcast++. HXcast++ optimized transfer path of multicast and reduced expensive multicast maintenance costs caused by frequent handoff. Suggestion of GMA (Group Management Agent) mechanism allows joining to group immediately without waiting IGMP Membership query during handoff. GMA mechanism will minimize the delay for group registration process and the resource usage due to delay of withdrawal process. And also use of buffering & forwarding technique minimized packet loss during generation of multicast tree. IntServ/RSVP was used to provide End-to-End QoS in local domain and DiffServ was used in global domain. To minimize reestablishment of RSVP session delay, extended HXcast++ control messages ware designed to require PATH message. HXcast++ proposed in this thesis is defined as multicast technique to provide end-to-end QoS and also to satisfy various user requirements in mobile network environment.