Abstract
Consider a family of sets and a single set, called query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Strict time constraints on the query and on a possible preprocessing of the set family make this problem challenging. Such maximal intersection queries arise in a wide range of applications, including web search, recommendation systems, and distributing on-line advertisements. In general, maximal intersection queries are computationally expensive. Therefore, one needs to add some assumptions about the input in order to get an efficient solution. We investigate two well-motivated distributions over all families of sets and propose an algorithm for each of them. We show that with very high probability an almost optimal solution is found in time logarithmic in the size of the family. In particular, we point out a threshold phenomenon on the probabilities of intersecting sets in each of our two input models which leads to the efficient algorithms mentioned above.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bruck, J., Naor, M.: The hardness of decoding linear codes with preprocessing. IEEE Transactions on Information Theory 36(2), 381–385 (1990)
Cole, R., Gottlieb, L.-A., Lewenstein, M.: Dictionary matching and indexing with errors and don’t cares. In: STOC 2004, pp. 91–100 (2004)
Kleinberg, J.M.: Two algorithms for nearest-neighbor search in high dimensions. In: STOC 1997, pp. 599–608 (1997)
Lifshits, Y.: A Guide to Web Research. Materials of mini-course at Stuttgart University (2007), Available at http://logic.pdmi.ras.ru/~yura/webguide.html
Maaß, M.G., Nowak, J.: A new method for approximate indexing and dictionary lookup with one error. Inf. Process. Lett. 96(5), 185–191 (2005)
Manning, C.D., Schütze, H.: Foundations of Statistical Natural Language Processing. MIT Press, Cambridge (2002)
Newman, M.: The structure and function of complex networks. SIAM Review 45(2), 167–256 (2003)
O’Connor, M., Herlocker, J.: Clustering items for collaborative filtering. In: SIGIR 2001, Workshop on Recommender Systems (2001)
Yianilos, P.N.: Data structures and algorithms for nearest neighbor search in general metric spaces. In: SODA 1993, pp. 311–321 (1993)
Zobel, J., Moffat, A.: Inverted files for text search engines. ACM Comput. Surv. 38(2), 6 (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hoffmann, B., Lifshits, Y., Nowotka, D. (2007). Maximal Intersection Queries in Randomized Graph Models. In: Diekert, V., Volkov, M.V., Voronkov, A. (eds) Computer Science – Theory and Applications. CSR 2007. Lecture Notes in Computer Science, vol 4649. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74510-5_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-74510-5_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74509-9
Online ISBN: 978-3-540-74510-5
eBook Packages: Computer ScienceComputer Science (R0)