enter search term and/or author name
Privacy has been identified as a vital requirement in designing and implementing data mining systems. In general, privacy preservation demands protecting both input and output privacy: the former refers to sanitizing the raw data...
Anonymization-based privacy protection ensures that data cannot be traced back to individuals. Researchers working in this area have proposed a wide variety of anonymization algorithms, many of which require a considerable number of database...
Query-preserving watermarking of relational databases and Xml documents
Article No.: 3
Watermarking allows robust and unobtrusive insertion of information in a digital document. During the last few years, techniques have been proposed for watermarking relational databases or Xml documents, where information insertion must preserve a...
Using structural information in XML keyword search effectively
Arash Termehchy, Marianne Winslett
Article No.: 4
The popularity of XML has exacerbated the need for an easy-to-use, high precision query interface for XML data. When traditional document-oriented keyword search techniques do not suffice, natural language interfaces and keyword search techniques...
Querying XML data sources that export very large sets of views
Bogdan Cautis, Alin Deutsch, Nicola Onose, Vasilis Vassalos
Article No.: 5
We study the problem of querying XML data sources that accept only a limited set of queries, such as sources accessible by Web services which can implement very large (potentially infinite) families of XPath queries. To compactly specify such...
Generating sound workflow views for correct provenance analysis
Ziyang Liu, Susan B. Davidson, Yi Chen
Article No.: 6
Workflow views abstract groups of tasks in a workflow into high level composite tasks, in order to reuse subworkflows and facilitate provenance analysis. However, unless a view is carefully designed, it may not preserve the dataflow between tasks...
Path-tree: An efficient reachability indexing scheme for large directed graphs
Ruoming Jin, Ning Ruan, Yang Xiang, Haixun Wang
Article No.: 7
Reachability query is one of the fundamental queries in graph database. The main idea behind answering reachability queries is to assign vertices with certain labels such that the reachability between any two vertices can be determined by the...