Database security: research and practice
Information Systems
Query evaluation: strategies and optimizations
Information Processing and Management: an International Journal
Self-indexing inverted files for fast text retrieval
ACM Transactions on Information Systems (TOIS)
Adaptive set intersections, unions, and differences
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Compression of inverted indexes For fast query evaluation
SIGIR '02 Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval
Introduction to Algorithms
Super-Scalar RAM-CPU Cache Compression
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Inverted files for text search engines
ACM Computing Surveys (CSUR)
Information Processing and Management: an International Journal
Hybrid index maintenance for growing text collections
SIGIR '06 Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
Optimizing web search using social annotations
Proceedings of the 16th international conference on World Wide Web
Lazy, adaptive rid-list intersection, and its application to index anding
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Generic database cost models for hierarchical memory systems
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Alternation and redundancy analysis of the intersection problem
ACM Transactions on Algorithms (TALG)
Performance of compressed inverted list caching in search engines
Proceedings of the 17th international conference on World Wide Web
Efficient online index construction for text databases
ACM Transactions on Database Systems (TODS)
Efficient top-k querying over social-tagging networks
Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval
Efficient network aware search in collaborative tagging sites
Proceedings of the VLDB Endowment
An experimental investigation of set intersection algorithms for text searching
Journal of Experimental Algorithmics (JEA)
Quantifying performance and quality gains in distributed web search engines
Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval
On-line index maintenance using horizontal partitioning
Proceedings of the 18th ACM conference on Information and knowledge management
Low-cost management of inverted files for online full-text search
Proceedings of the 18th ACM conference on Information and knowledge management
Compact set representation for information retrieval
SPIRE'07 Proceedings of the 14th international conference on String processing and information retrieval
Feeding frenzy: selectively materializing users' event feeds
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Search in social networks with access control
Proceedings of the 2nd International Workshop on Keyword Search on Structured Data
Information retrieval in folksonomies: search and ranking
ESWC'06 Proceedings of the 3rd European conference on The Semantic Web: research and applications
Worst case optimal union-intersection expression evaluation
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Fast intersection algorithms for sorted sequences
Algorithms and Applications
Hi-index | 0.00 |
More and more data is accumulated inside social networks. Keyword search provides a simple interface for exploring this content. However, a lot of the content is private, and a search system must enforce the privacy settings of the social network. In this paper, we present a workload-aware keyword search system with access control based on a social network. We make two technical contributions: (1) HeapUnion, a novel union operator that improves processing of search queries with access control by up to a factor of two compared to the best previous solution; and (2) highly accurate cost models that vary in sophistication and accuracy; these cost models provide input to an optimization algorithm that selects the most efficient organization of access control meta-data for a given workload. Our experimental results with real and synthetic data show that our approach outperforms previous work by up to a factor of three.