Efficient Evaluation of Shared Predicates for XForms Page Access Control 


Vol. 15,  No. 4, pp. 441-450, Aug.  2008
10.3745/KIPSTD.2008.15.4.441


PDF
  Abstract

Recently, access control on form-based web information systems has become one of the useful methods for implementing client systems in a service-oriented architecture. In particular, XForms language is being adopted in many systems as a description language for XML-based user interfaces and server interactions. In this paper, we propose an efficient algorithm for the evaluation of XPath-based access rules for XForms pages. In this model, an XForms page is a sequence of queries and the client system performs user interface realization along with XPath rule evaluations. XPath rules have instance-dependent predicates, which for the most part are shared between rules. For the efficient evaluation of shared predicate expressions in access control rules, we proposed a predicate graph model that reuses the previously evaluated results for the same context node. This approach guarantees that each predicate expression is evaluated for the relevant xml node only once.

  Statistics
  Cite this article

[IEEE Style]

E. J. Lee, "Efficient Evaluation of Shared Predicates for XForms Page Access Control," The KIPS Transactions:PartD, vol. 15, no. 4, pp. 441-450, 2008. DOI: 10.3745/KIPSTD.2008.15.4.441.

[ACM Style]

Eun Jung Lee. 2008. Efficient Evaluation of Shared Predicates for XForms Page Access Control. The KIPS Transactions:PartD, 15, 4, (2008), 441-450. DOI: 10.3745/KIPSTD.2008.15.4.441.

Forms

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)

Old Journals

Indexing

All publications of TKIPS is indexed in DOI, EBSCO, Google Scholar, Crossref, and CrossCheck.

TKIPS is also selected as the Journal for Accreditation by NRF (National Research Foundation of Korea).

Related Journals