The dynamic predicate: integrating access control with query processing in XML databases

  • Authors:

  • Jae-Gil Lee;Kyu-Young Whang;Wook-Shin Han;Il-Yeol Song

  • Affiliations:

  • Department of Computer Science and Advanced Information Technology Research Center (AITrc), Korea Advanced Institute of Science and Technology (KAIST), Daejeon, South Korea 305-701;Department of Computer Science and Advanced Information Technology Research Center (AITrc), Korea Advanced Institute of Science and Technology (KAIST), Daejeon, South Korea 305-701;Department of Computer Engineering, Kyungpook National University, Daegu, South Korea 702-701;College of Information Science and Technology, Drexel University, Philadelphia, USA 19104

  • Venue:
  • The VLDB Journal — The International Journal on Very Large Data Bases
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Recently, access control on XML data has become an important research topic. Previous research on access control mechanisms for XML data has focused on increasing the efficiency of access control itself, but has not addressed the issue of integrating access control with query processing. In this paper, we propose an efficient access control mechanism tightly integrated with query processing for XML databases. We present the novel concept of the dynamic predicate (DP), which represents a dynamically constructed condition during query execution. A DP is derived from instance-level authorizations and constrains accessibility of the elements. The DP allows us to effectively integrate authorization checking into the query plan so that unauthorized elements are excluded in the process of query execution. Experimental results show that the proposed access control mechanism improves query processing time significantly over the state-of-the-art access control mechanisms. We conclude that the DP is highly effective in efficiently checking instance-level authorizations in databases with hierarchical structures.