On-line index maintenance using horizontal partitioning

Gurajada, Sairam; P, Sreenivasa Kumar

doi:10.1145/1645953.1646010

Cited by 12 publications

(5 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The accumulated postings are routinely combined with the rest of the data in a hierarchy based on geometric partitioning [8]. More advanced techniques exist [7,9], but they would not change the tradeoffs that we show. We use PForDelta [15] for compression, which has shown efficient decompression performance in recent studies [13].…”

Section: Methodsmentioning

confidence: 93%

Search in social networks with access control

Bjørklund

Götz

Gehrke

2010

Proceedings of the 2nd International Workshop on Keyword Search on Structured Data

View full text Add to dashboard Cite

More and more important data is accumulated inside social networks. Limiting the flow of private information across a social network is very important, and most social networks provide sophisticated privacy settings to control this flow. Creating such extensive access control knobs makes the search for content a hard problem since each user sees a unique subset of all the data.In this work, we take a first step at integrating access control based on a social network in a search system. We describe a set of solutions to the problem, including what indexes to construct and how to filter out inaccessible results. An experimental analysis illustrates the tradeoffs of the various strategies, and we point out a set of interesting future research directions in this area.

show abstract

Section: Methodsmentioning

confidence: 93%

Search in social networks with access control

Bjørklund

Götz

Gehrke

2010

Proceedings of the 2nd International Workshop on Keyword Search on Structured Data

View full text Add to dashboard Cite

show abstract

“…For index update, Margaritis and Anastasiadis (2009) only flush selectively the terms with most posting lists in memory into disk to merge it with primary index when the memory gets full with new posting lists. Gurajada and Kumar (2009) propose a new merge-based index maintenance strategy for information retrieval systems. This strategy partitions the index into frequent-term index and infrequent-term index based on the frequency of terms, and uses a lazy-merge strategy for maintaining infrequent-term index and an active merge strategy for maintaining frequent-term index.…”

Section: Related Workmentioning

confidence: 99%

Mimir: a term-distributed retrieval system for secret documents

Gao

2018

IJICT

View full text Add to dashboard Cite

In order to access sensitive documents shared over government, army and enterprise intranets, users rely on an indexing facility where they can quickly locate relevant documents they are allowed to access: 1) without leaking information about the remaining documents; 2) with a balanced load on the index servers. To address this problem, we propose Mimir, a distributed cipher retrieval system for sensitive documents. Mimir constructs the distributed indexes based on load balanced term distribution for better search efficiency and load balanced query. Mimir utilises encryption with random key, partial key update to protect sensitive data and improve query efficiency. Our experiments show that Mimir can effectively protect secret data and answer queries nearly as fast as an ordinary inverted index.

show abstract

“…Each query event includes the fields id, query terms, and time. Although controversial, the query log is publicly-available and used widely (e.g., [20], [22], [10], [15], [19], and [1]), which simplifies comparisons to past and future results. Existing research has also investigated how to effectively anonymize such query logs (e.g., [21], [11], and [14]).…”

Section: Query Logmentioning

confidence: 99%

Rank-energy selective query forwarding for distributed search systems

Teymorian¹,

Maloof²

2013

Proceedings of the 22nd ACM International Conference on Information &Amp; Knowledge Management

View full text Add to dashboard Cite

Scaling high-quality, cost-efficient query evaluation is critical to search system performance. Although partial indexes reduce query processing times, result quality may be jeopardized due to exclusion of relevant non-local documents. Selectively forwarding queries between geographically distributed search sites may help. The basic idea of query forwarding is that after a local site receives a query, it determines non-local sites to forward the query to and returns an aggregation of the local and non-local results. Nevertheless, electricity costs remain substantial sources of operating expenses. We present a hybrid rank-energy query forwarding model termed "RESQ." The novel contribution is to simultaneously consider both ranking quality and spatiallytemporally varying energy prices when making forwarding decisions. Experiments with a large-scale query log, publiclyavailable electricity price data, and real search site locations demonstrate that query forwarding under RESQ achieves the result scalability of partial indexes with the cost savings of energy-aware approaches (e.g., an 87% ranking guarantee with a 46% savings in energy costs).

show abstract

On-line index maintenance using horizontal partitioning

Cited by 12 publications

References 15 publications

Search in social networks with access control

Search in social networks with access control

Mimir: a term-distributed retrieval system for secret documents

Rank-energy selective query forwarding for distributed search systems

Contact Info

Product

Resources

About