Skip to main content
SpringerLink
Log in

Search Support in Data Management Systems

  • Chapter
Data Management in a Connected World

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 3551))

  • 616 Accesses

Abstract

In consequence of the change in the nature of data management systems the requirements for search support have shifted. In the early days of data management systems, efficient access techniques and optimization strategies for exact match queries had been the main focus. Most of the problems in this field are satisfactorily solved today and new types of applications for data management systems have turned the focus of current research to content-based similarity queries and queries on distributed databases. The present contribution addresses these two aspects. In the first part, algorithms and data structures supporting similarity queries are presented together with considerations about their integration in data management systems, whereas search techniques for distributed data management systems and especially for peer-to-peer networks are discussed in the second part. Here, techniques for exact match queries and for similarity queries are addressed.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baeza-Yates, R., Ribeiro-Neto, B.: Modern Information Retrieval. ACM press. Pearson Education Limited, Harlow, England (1999)

    Google Scholar 

  2. Balakrishnan, H., Kasshoek, M.F., Karger, D., Morris, R., Stoica, I.: Looking Up Data in P2P Systems. Commun. ACM 46(2), 43–48 (2003)

    Article  Google Scholar 

  3. Balko, S., Schmitt, I.: Efficient Nearest Neighbor Retrieval by Using a Local Approximation Technique - the Active Vertice Approach. Technical Report 2, Fakultät für Informatik, Universität Magdeburg (2002)

    Google Scholar 

  4. Buckley, C., Lewit, A.: Optimization of inverted vector searches. In: Proc. 8th International ACM SIGIR Conference on Research and Development in Information Retrieval, New York, USA, pp. 97–105 (1985)

    Google Scholar 

  5. Carey, M.J., Kossmann, D.: On saying Enough already.SQL. In Proc. 1997 ACM SIGMOD Intl. Conf. on Management of Data, Tucson, Arizona, June 13–15, pp. 219-230 (1997)

    Google Scholar 

  6. Chaudhuri, S., Gravano, L.: Evaluating top-k selection queries. In: Proc. 25th Intl. Conf. on Very Large Data Bases, Edinburgh, Scotland, UK, September 1999, pp. 397–410 (1999)

    Google Scholar 

  7. Clarke, I., Sandberg, O., Wiley, B., Hong, T.W.: Freenet: A distributed anonymous information storage and retrieval system. In: Federrath, H. (ed.) Designing Privacy Enhancing Technologies. LNCS, vol. 2009, p. 46. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  8. Cuenca-Acuna, F. M., Nguyen, T. D.: Text-Based Content Search and Retrieval in ad hoc P2P Communities. Technical Report DCS-TR-483, Department of Computer Science, Rutgers University (2002)

    Google Scholar 

  9. Fagin, R., Lotem, A., Naor, M.: Optimal aggregation algorithms for middleware. In: Proc. 10th ACM Symposium on Principles of Database Systems: PODS, New York, USA, pp. 102–113 (2001)

    Google Scholar 

  10. Fagin, R., Wimmers, E.L.: A formula for incorporating weights into scoring rules. Theoretical Computer Science 239(2), 309–338 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  11. Güntzer, U., Balke, W.-T., Kießling, W.: Optimizing multi-feature queries for image databases. In: VLDB 2000, Proc. 26th Intl. Conf. on Very Large Data Bases, Cairo, Egypt, pp. 419–428 (2000)

    Google Scholar 

  12. Härder, T., Rahm, E.: Datenbanksysteme: Konzepte und Techniken der Implementierung, 2nd edn. Springer, Heidelberg (2001)

    MATH  Google Scholar 

  13. Henrich, A.: A distance scan algorithm for spatial access structures. In: Proc. of the 2nd ACM Workshop on Advances in Geographic Information Systems, Gaithersburg, Maryland, USA, pp. 136–143. ACM Press, New York (1994)

    Google Scholar 

  14. Henrich, A.: The LSD6h-tree: An access structure for feature vectors. In: Proc. 14th Intl. Conf. on Data Engineering, Orlando, Florida, USA, February 23-27, pp. 362–369. IEEE Computer Society, Los Alamitos (1998)

    Chapter  Google Scholar 

  15. Henrich, A., Robbert, G.: Combining multimedia retrieval and text retrieval to search structured documents in digital libraries. In: Proc. 1st DELOS Workshop on Information Seeking, Searching and Querying in Digital Libraries, Zürich, Switzerland, December 2000, pp. 35–40 (2000)

    Google Scholar 

  16. Henrich, A., Robbert, G.: Ein Ansatz zur Übertragung von Rangordnungen bei der Suche auf strukturierten Daten. In: Tagungsband der 10. Konferenz Datenbanksysteme für Business, Technologie und Web (BTW 2003),, Leipzig, Deutschland,GI, February 2003, vol. 26, LNI pp. 167–186 (2003)

    Google Scholar 

  17. Henrich, A., Robbert, G.: Comparison and evaluation of fusion algorithms and transfer semantics for structured multimedia data. In: Danilowicz, C. (ed.) 1st International Workshop on Multimedia Information Systems Technology, Multimedia and Network Information Systems, Szklarska Poreba, Poland, September 2004, pp. 181–192 (2004) Oficyna Wydawinicza Politechniki Wroclawskiej

    Google Scholar 

  18. Herstel, T., Schmitt, I.: Optimierung von Ausdrücken der Ähnlichkeitsalgebra SA. In: INFORMATIK 2004 - Informatik verbindet - Beiträge der 34. Jahrestagung der Gesellschaft für Informatik e.V (GI), Band 2, Ulm, Germany, September 2004, vol. P-51 LNI, pp. 49–53 (2004)

    Google Scholar 

  19. Hjaltason, G.R., Samet, H.: Ranking in spatial databases. In: Egenhofer, M.J., Herring, J.R. (eds.) SSD 1995. LNCS, vol. 951, pp. 83–95. Springer, Heidelberg (1995)

    Google Scholar 

  20. Joseph, S.: Adaptive routing in distributed decentralized systems: Neurogrid, Gnutella and Freenet. In: Proc. of workshop on Infrastructure for Agents, MAS, and Scalable MAS, at Autonomous Agents, Montreal, Canada (2001)

    Google Scholar 

  21. Kronfol, A. Z.: A Fault-tolerant, Adaptive, Scalable, Distributed Search Engine (May 2002) Final Thesis, Princeton, http://www.searchlore.org/library/kronfol_final_thesis.pdf

  22. Lomet, D.B., Salzberg, B.: The hb-tree: A multiattribute indexing method with good guaranteed performance. ACM Trans. Database Syst. 15(4), 625–658 (1990)

    Article  Google Scholar 

  23. Müller, H., Squire, D. M., Müller, W., Pun, T.: Efficient access methods for content-based image retrieval with inverted files. Technical Report 99.02, Computer Vision Group, University of Geneva (July 1999)

    Google Scholar 

  24. Müller, W., Eisenhardt, M., Henrich, A.: Scalable summary-based search in P2P networks (2004) (submitted for publication)

    Google Scholar 

  25. Müller, W., Henrich, A.: Faster exact histogram intersection on large data collections using inverted VA-files. In: Enser, P.G.B., Kompatsiaris, Y., O’Connor, N.E., Smeaton, A., Smeulders, A.W.M. (eds.) CIVR 2004. LNCS, vol. 3115, pp. 455–463. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  26. Müller, W., Henrich, A.: Reducing I/O cost of similarity queries by processing several at a time. In: Proc. MDDE 2004, 4th International Workshop on Multimedia Data and Document Engineering, Washington DC, USA, July 2004, IEEE Computer Society, Los Alamitos (2004)

    Google Scholar 

  27. Natsev, A., Chang, Y.-C., Smith, J.R., Li, C.-S., Vitter, J.S.: Supporting incremental join queries on ranked inputs. In: VLDB 2001, Proc. of 27th Intl. Conf. on Very Large Data Bases, Roma, Italy, pp. 281–290 9 (2001)

    Google Scholar 

  28. Ng, C.H., Sia, K.C.: Peer clustering and firework query model. In: Poster Proc. of The 11th Interational World Wide Web Conf. Honululu, HI, USA (May 2002)

    Google Scholar 

  29. Pfeifer, U., Pennekamp, S.: Incremental Processing of Vague Queries in Interactive Retrieval Systems. In: Hypertext - Information Retrieval - Multimedia 1997: Theorien, Modelle und Implementierungen integrierter elektronischer Informationssysteme, Dortmund, pp. 223–235. Universitätsverlag Konstanz (1997)

    Google Scholar 

  30. Ratnasamy, S., Francis, P., Handley, M., Karp, R., Schenker, S.: A scalable content-addressable network. In: Proc. 2001 Conf. on applications, technologies, architectures, and protocols for computer communications, San Diego, CA (2001)

    Google Scholar 

  31. Roussopoulos, N., Kelley, S., Vincent, F.: Nearest neighbor queries. In: Proc. 1995 ACM SIGMOD Intl. Conf. on Management of Data, San Jose, California, May 22-25, pp. 71–79 (1995)

    Google Scholar 

  32. Sakurai, Y., Yoshikawa, M., Uemura, S., Kojima, H.: The A-tree: An index structure for high-dimensional spaces using relative approximation. In: Proc. of the 26th Intl. Conf. on Very Large Data Bases, Cairo, pp. 516–526 (2000)

    Google Scholar 

  33. Schmitt, I., Schulz, N.: Similarity relational calculus and its reduction to a similarity algebra. In: Seipel, D., Turull-Torres, J.M.a. (eds.) FoIKS 2004. LNCS, vol. 2942, pp. 252–272. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  34. Smith, I., Chang, S.-F.: VisualSEEK: A fully automated content-based image query system. In: Proc. of the 4th ACM Multimedia Conf., New York, USA, November 1996, pp. 87–98 (1996)

    Google Scholar 

  35. Squire, D.M., Müller, W., Müller, H., Raki, J.: Content-based query of image databases, inspirations from text retrieval: inverted files, frequency-based weights and relevance feedback. In: 11th Scandinavian Conf. on Image Analysis, Kangerlussuaq, Greenland (1999)

    Google Scholar 

  36. Stoica, I., Morris, R., Karger, D., Kaashoek, F., Balakrishnan, H.: Chord: A scalable Peer-To-Peer lookup service for Internet applications. In: Proc. ACM SIGCOMM Conf. San Diego, CA, USA (2001)

    Google Scholar 

  37. Tang, C., Xu, Z., Mahalingam, M.: pSearch: Information retrieval in structured overlays. In: First Workshop on Hot Topics in Networks (HotNets-I), Princeton, NJ (2002)

    Google Scholar 

  38. Weber, R., Schek, H.-J., Blott, S.: A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In: Proc. Intl. Conf. on VLDB, New York, USA (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Otto-Friedrich-Universität Bamberg, Germany

    Andreas Henrich

Authors
  1. Andreas Henrich
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. AG DBIS, Department of Computer Science, University of Kaiserslautern, Germany

    Theo Härder

  2. Database Technology Group, Technische Universität Dresden, Germany

    Wolfgang Lehner

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Henrich, A. (2005). Search Support in Data Management Systems. In: Härder, T., Lehner, W. (eds) Data Management in a Connected World. Lecture Notes in Computer Science, vol 3551. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11499923_8

Download citation

  • DOI: https://doi.org/10.1007/11499923_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-26295-4

  • Online ISBN: 978-3-540-31654-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation