Database security: research and practice
Information Systems
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
Volcano— An Extensible and Parallel Query Evaluation System
IEEE Transactions on Knowledge and Data Engineering
Fast on-line index construction by geometric partitioning
Proceedings of the 14th ACM international conference on Information and knowledge management
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)
Secure search in enterprise webs: tradeoffs in efficient implementation for document level security
CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
A security model for full-text file system search in multi-user environments
FAST'05 Proceedings of the 4th conference on USENIX Conference on File and Storage Technologies - Volume 4
Zerber: r-confidential indexing for distributed documents
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Performance of compressed inverted list caching in search engines
Proceedings of the 17th international conference on World Wide Web
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
Personalized social search based on the user's social network
Proceedings of the 18th ACM conference on Information and knowledge management
Workload-aware indexing for keyword search in social networks
Proceedings of the 20th ACM international conference on Information and knowledge management
Evolving social search based on bookmarks and status messages from social networks
Proceedings of the 20th ACM international conference on Information and knowledge management
| Hi-index | 0.00 |
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.