A compressed accessibility map for XML

Ting Yu, Divesh Srivastava, Laks V S Lakshmanan, H. V. Jagadish

Research output: Contribution to journalArticle

20 Citations (Scopus)

Abstract

XML is the undisputed standard for data representation and exchange. As companies transact business over the Internet, letting authorized customers directly access, and even modify, XML data offers many advantages in terms of cost, accuracy, and timeliness. Given the complex business relationships between companies, and the sensitive nature of information, access must be provided selectively, using sophisticated access control specifications. Using the specification directly to determine if a user has access to an XML data item can be extremely inefficient. The alternative of fully materializing, for each data item, the users authorized to access it can be space-inefficient. In this article, we introduce a compressed accessibility map (CAM) as a space- and time-efficient solution to the access control problem for XML data. A CAM compactly identifies the XML data items to which a user has access, by exploiting structural locality of accessibility in tree-structured data. We present a CAM lookup algorithm for determining if a user has access to a data item that takes time proportional to the product of the depth of the item in the XML data and logarithm of the CAM size. We develop an algorithm for building an optimal size CAM that takes time linear in the size of the XML data set. While optimality cannot be preserved incrementally under data item updates, we provide an algorithm for incrementally maintaining near-optimality. Finally, we experimentally demonstrate the effectiveness of the CAM for multiple users on a variety of real and synthetic data sets.

Original languageEnglish
Pages (from-to)363-402
Number of pages40
JournalACM Transactions on Database Systems
Volume29
Issue number2
DOIs
Publication statusPublished - 1 Jun 2004
Externally publishedYes

Fingerprint

XML
Access control
Industry
Specifications
Internet
Costs

Keywords

  • Access control
  • Structural locality
  • XML

ASJC Scopus subject areas

  • Information Systems
  • Computer Graphics and Computer-Aided Design
  • Software

Cite this

Yu, T., Srivastava, D., Lakshmanan, L. V. S., & Jagadish, H. V. (2004). A compressed accessibility map for XML. ACM Transactions on Database Systems, 29(2), 363-402. https://doi.org/10.1145/1005566.1005570

A compressed accessibility map for XML. / Yu, Ting; Srivastava, Divesh; Lakshmanan, Laks V S; Jagadish, H. V.

In: ACM Transactions on Database Systems, Vol. 29, No. 2, 01.06.2004, p. 363-402.

Research output: Contribution to journalArticle

Yu, T, Srivastava, D, Lakshmanan, LVS & Jagadish, HV 2004, 'A compressed accessibility map for XML', ACM Transactions on Database Systems, vol. 29, no. 2, pp. 363-402. https://doi.org/10.1145/1005566.1005570
Yu, Ting ; Srivastava, Divesh ; Lakshmanan, Laks V S ; Jagadish, H. V. / A compressed accessibility map for XML. In: ACM Transactions on Database Systems. 2004 ; Vol. 29, No. 2. pp. 363-402.
@article{55a35a25a73e43e790a2394d8bee360f,
title = "A compressed accessibility map for XML",
abstract = "XML is the undisputed standard for data representation and exchange. As companies transact business over the Internet, letting authorized customers directly access, and even modify, XML data offers many advantages in terms of cost, accuracy, and timeliness. Given the complex business relationships between companies, and the sensitive nature of information, access must be provided selectively, using sophisticated access control specifications. Using the specification directly to determine if a user has access to an XML data item can be extremely inefficient. The alternative of fully materializing, for each data item, the users authorized to access it can be space-inefficient. In this article, we introduce a compressed accessibility map (CAM) as a space- and time-efficient solution to the access control problem for XML data. A CAM compactly identifies the XML data items to which a user has access, by exploiting structural locality of accessibility in tree-structured data. We present a CAM lookup algorithm for determining if a user has access to a data item that takes time proportional to the product of the depth of the item in the XML data and logarithm of the CAM size. We develop an algorithm for building an optimal size CAM that takes time linear in the size of the XML data set. While optimality cannot be preserved incrementally under data item updates, we provide an algorithm for incrementally maintaining near-optimality. Finally, we experimentally demonstrate the effectiveness of the CAM for multiple users on a variety of real and synthetic data sets.",
keywords = "Access control, Structural locality, XML",
author = "Ting Yu and Divesh Srivastava and Lakshmanan, {Laks V S} and Jagadish, {H. V.}",
year = "2004",
month = "6",
day = "1",
doi = "10.1145/1005566.1005570",
language = "English",
volume = "29",
pages = "363--402",
journal = "ACM Transactions on Database Systems",
issn = "0362-5915",
publisher = "Association for Computing Machinery (ACM)",
number = "2",

}

TY - JOUR

T1 - A compressed accessibility map for XML

AU - Yu, Ting

AU - Srivastava, Divesh

AU - Lakshmanan, Laks V S

AU - Jagadish, H. V.

PY - 2004/6/1

Y1 - 2004/6/1

N2 - XML is the undisputed standard for data representation and exchange. As companies transact business over the Internet, letting authorized customers directly access, and even modify, XML data offers many advantages in terms of cost, accuracy, and timeliness. Given the complex business relationships between companies, and the sensitive nature of information, access must be provided selectively, using sophisticated access control specifications. Using the specification directly to determine if a user has access to an XML data item can be extremely inefficient. The alternative of fully materializing, for each data item, the users authorized to access it can be space-inefficient. In this article, we introduce a compressed accessibility map (CAM) as a space- and time-efficient solution to the access control problem for XML data. A CAM compactly identifies the XML data items to which a user has access, by exploiting structural locality of accessibility in tree-structured data. We present a CAM lookup algorithm for determining if a user has access to a data item that takes time proportional to the product of the depth of the item in the XML data and logarithm of the CAM size. We develop an algorithm for building an optimal size CAM that takes time linear in the size of the XML data set. While optimality cannot be preserved incrementally under data item updates, we provide an algorithm for incrementally maintaining near-optimality. Finally, we experimentally demonstrate the effectiveness of the CAM for multiple users on a variety of real and synthetic data sets.

AB - XML is the undisputed standard for data representation and exchange. As companies transact business over the Internet, letting authorized customers directly access, and even modify, XML data offers many advantages in terms of cost, accuracy, and timeliness. Given the complex business relationships between companies, and the sensitive nature of information, access must be provided selectively, using sophisticated access control specifications. Using the specification directly to determine if a user has access to an XML data item can be extremely inefficient. The alternative of fully materializing, for each data item, the users authorized to access it can be space-inefficient. In this article, we introduce a compressed accessibility map (CAM) as a space- and time-efficient solution to the access control problem for XML data. A CAM compactly identifies the XML data items to which a user has access, by exploiting structural locality of accessibility in tree-structured data. We present a CAM lookup algorithm for determining if a user has access to a data item that takes time proportional to the product of the depth of the item in the XML data and logarithm of the CAM size. We develop an algorithm for building an optimal size CAM that takes time linear in the size of the XML data set. While optimality cannot be preserved incrementally under data item updates, we provide an algorithm for incrementally maintaining near-optimality. Finally, we experimentally demonstrate the effectiveness of the CAM for multiple users on a variety of real and synthetic data sets.

KW - Access control

KW - Structural locality

KW - XML

UR - http://www.scopus.com/inward/record.url?scp=3142624792&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=3142624792&partnerID=8YFLogxK

U2 - 10.1145/1005566.1005570

DO - 10.1145/1005566.1005570

M3 - Article

VL - 29

SP - 363

EP - 402

JO - ACM Transactions on Database Systems

JF - ACM Transactions on Database Systems

SN - 0362-5915

IS - 2

ER -