Trustworthy keyword search for compliance storage

Mitra, Saayan; Winslett, Marianne; Hsu, Windsor W.; Chang, Kevin Chen-Chuan

doi:10.1007/s00778-007-0069-7

Cited by 15 publications

(24 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There are also some proposals focusing on the WriteOnce-Read-Many (WORM) storage [12], [17]. In [12], Mitra proposed an inverted index for keyword-based search and a secure jump index structure for multi-keyword searches.…”

Section: Related Workmentioning

confidence: 99%

<inline-formula> <tex-math notation="TeX">\(\mathsf{B}^{p}\) </tex-math></inline-formula>-<inline-formula> <tex-math notation="TeX">\(\mathsf{Tree}\) </tex-math></inline-formula>: A Predictive <inline-formula> <tex-math notation="TeX">\(\mathsf{B}^{+}\) </tex-math></inline-formula>-<inline-formula> <tex-math notation="TeX">\(\mathsf{Tree}\) </tex-math></inline-formula> for Reducing Writes on Phase Change Memory

Sun

et al. 2014

IEEE Trans. Knowl. Data Eng.

View full text Add to dashboard Cite

Phase change memory (PCM) has been considered an attractive alternative to flash memory and DRAM. It has promising features, including non-volatile storage, byte addressability, fast read and write operations, and supports random accesses. However, there are challenges in designing algorithms for PCM-based memory systems, such as longer write latency and higher energy consumption compared to DRAM. In this paper, we propose a new predictive B + -tree index, called the B p -tree, which is tailored for database systems that make use of PCM. Our B p -tree reduces data movements caused by tree node splits and merges that arise from insertions and deletions. This is achieved by pre-allocating space on PCM for near future data. To ensure the space are allocated where they are needed, we propose a novel predictive model to ascertain future data distribution based on the current data. In addition, as in [4], when keys are inserted into a leaf node, they are packed but need not be in sorted order. We have implemented the B p -tree in PostgreSQL and evaluated it in an emulated environment. Our experimental results show that the B p -tree significantly reduces the number of writes, therefore making it write and energy efficient and suitable for a PCM-like hardware environment.

show abstract

Section: Related Workmentioning

confidence: 99%

<inline-formula> <tex-math notation="TeX">\(\mathsf{B}^{p}\) </tex-math></inline-formula>-<inline-formula> <tex-math notation="TeX">\(\mathsf{Tree}\) </tex-math></inline-formula>: A Predictive <inline-formula> <tex-math notation="TeX">\(\mathsf{B}^{+}\) </tex-math></inline-formula>-<inline-formula> <tex-math notation="TeX">\(\mathsf{Tree}\) </tex-math></inline-formula> for Reducing Writes on Phase Change Memory

Sun

et al. 2014

IEEE Trans. Knowl. Data Eng.

View full text Add to dashboard Cite

show abstract

“…X. Chen, X. Zhang, 'HAWK: A Focused Crawler with Content and Link Analysis' is implemented using user-defined relevant formula, shark-search and Page-Rank. Soumyadeb Mitra [5] has put forth a procedure to update an inverted index based on merging of the posting lists of terms. He has evaluated jump index, which is an efficient index for join queries.…”

Section: IImentioning

confidence: 99%

An Improved Indexing Mechanism to Index Web Documents

Mudgil

Sharma

Gupta

2013

2013 5th International Conference on Computational Intelligence and Communication Networks

View full text Add to dashboard Cite

Owing to the dynamic nature of the web, it is difficult for search engine to find the relevant documents to serve a user query. For this purpose, search engine maintains the index of downloaded documents stored in the local repository. Whenever a query comes search engine searches the index in order to find the relevant matched results to be presented to the user. The quality of the matched result depends on the information stored in the index. The more efficient is the structure of index, more efficient the performance of search engine. Generally, inverted index are based solely on the frequency of keywords present in number of documents. In order to improve the efficiency of the search engine, an improved indexing mechanism to index the web documents is being proposed that keeps the context related information integrated with the frequency of the keyword. The structure is implemented using Trie. The implementation results on various documents show that proposed index efficiently stores the documents and search is fast.

show abstract

“…A different approach to solving the above problem is to introduce the notion of a regret interval [16]. This is a minimal time interval, I R , before any adversary can reverse the change they have made.…”

Section: Very Recent Corruptionsmentioning

confidence: 99%

Temporal Implications of Database Information Accountability

Pavlou

Snodgrass

2012

2012 19th International Symposium on Temporal Representation and Reasoning

View full text Add to dashboard Cite

Abstract-Information restriction controls access and renders records immutable; information accountability requires data transparency to easily and efficiently determine when a particular use is appropriate. Information accountability in the context of relational databases is associated with time in a surprising number of ways, as is summarized in this paper. Notarization and validation of a database exploit the temporal semantics of a transaction-time database. A corruption can be associated with multiple times. Forensic analysis determines the when: bounds on the corruption time, and the where: also specified in terms of time. These bounds are depicted in a two-dimensional corruption diagram, with both axes denoting time. The various kinds of corruption events are defined in terms of time. A parameter termed the regret interval has significant security and performance implications. This paper emphasizes the deep connections between time and the definition, detection, forensic analysis, and characterized extent of a database corruption within the context of information accountability.Keywords-information accountability; temporal semantics; transaction-time databases; forensic analysis;The prevailing approach to achieving privacy and security for databases is information restriction. For example, ensuring record compliance, or information compliance in general, usually entails rendering retained records immutable and controlling access to them. We feel that the means of addressing security and compliance should be viewed as constituting a spectrum. If one asserts that information restriction lies at one end of the spectrum then the question which inevitably arises is what lies at the other end? In a recent article Weitzner et al. [1] argue that access control and cryptography are not capable of protecting information privacy and that there is a true dearth of mechanisms for effectively addressing information leaks. They propose that as an alternative information accountability "must become a primary means through which society addresses appropriate use" [1]. Information accountability assumes that information should be transparent so as to easily determine whether a particular use is appropriate under a given set of rules. A related concept is continuous assurance technology, defined as "technology-enabled auditing which produces audit results simultaneously with, or a short period of time after, the occurrence of relevant events" [2]. This concept is crucial because it can be used to achieve a meaningful operationalization of information accountability. This paper studies the overlap of time, databases, and security, as shown in Figure 1. We have encountered time in this context in many different places and under many different guises. This suggests a deep connection between the general topics of (i) temporal databases and (ii) information accountability. Our purpose here is to identify the many instances where time appears in the definition and implementation of information accountability and to discuss new ti...

show abstract

Trustworthy keyword search for compliance storage

Cited by 15 publications

References 13 publications

An Improved Indexing Mechanism to Index Web Documents

Temporal Implications of Database Information Accountability

Contact Info

Product

Resources

About