PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A survey in indexing and searching XML documents
Journal of the American Society for Information Science and Technology - XML
Bundles in Captivity: An Application of Superimposed Information
Proceedings of the 17th International Conference on Data Engineering
Active Views for Electronic Commerce
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Putting integrated information in context: superimposing conceptual models with SPARCE
APCCM '04 Proceedings of the first Asian-Pacific conference on Conceptual modelling - Volume 31
Colorful XML: one hierarchy isn't enough
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
MONDRIAN: Annotating and Querying Databases through Colors and Blocks
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Reformulating XPath queries and XSLT queries on XSLT views
Data & Knowledge Engineering
SMOQE: a system for providing secure access to XML
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Limiting disclosure in hippocratic databases
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
On the expressiveness of implicit provenance in query and update languages
ICDT'07 Proceedings of the 11th international conference on Database Theory
| Hi-index | 0.00 |
XML schemas often allow many aspects of an object to be described in the same document, but queries over such documents might be concerned with just one aspect. For example, an XML representation of a spreadsheet can include both spreadsheet data and styling, but a query might address only the data portions. In these situations, traditional approaches first define a data-only view and then query that view. However, these approaches can make it hard to define views and to express queries; and in some cases (even with view unfolding), they can even make query-execution inefficient in terms of time and space. We propose cloaking document parts and selectively revealing the cloaked parts as an alternative. Cloaking exposes many simultaneous conceptual views of a document without constructing new data, allows queries to be expressed in existing languages, and it can be easily supported in existing query processors. In this paper, we present a formal model for cloaking, its application in a cloaking query processor, and the results of an experimental evaluation in the context of superimposedinformation (SI, information with references to existing information) and bi-level information (SI along with the referenced information). Our experiments suggest that cloaking can make it easier to define views and to express queries, and that for certain query classes, a cloaking query processor saves both time and memory when compared to a traditional query processor.