Andreas Henrich Papers on DiSC'04 Fast Retrieval of High-Dimensional Feature Vectors in P2P Networks Using Compact Peer Data Summaries RSV-Transfer: An Algorithm for Similarity Queries on Structured Documents Publications Note: Links lead to the DBLP on the Web. Andreas Henrich Andreas Henrich, Günter Robbert : Ein Ansatz zur Übertragung von Rangordnungen bei der Suche auf strukturierten Daten. BTW 2003 : 167-186 Andreas Henrich, Günter Robbert : Implementation of a Stream-Oriented Retrieval Engine for Complex Similarity Queries on Top of an ORDBMS. DEXA 2003 : 611-621 Andreas Henrich, Karlheinz Morgenroth : Supporting Collaborative Software Development by Context-Aware Information Retrieval Facilities. DEXA Workshops 2003 : 249-253 Bernhard Daubner , Andreas Henrich: Ein Plädoyer für Datenflussdiagramme aus der Sicht der Aufwandsschatzung und der agilen Softwareentwicklung. GI Jahrestagung (1) 2003 : 191-195 Andreas Henrich: Innovative Anwendungen des Information Retrieval für Internet und Intranet. GI Jahrestagung (2) 2003 : 260-261 Martin Eisenhardt , Wolfgang Müller , Andreas Henrich: Classifying Documents by Distributed P2P Clustering. GI Jahrestagung (2) 2003 : 286-291 Wolfgang Müller , Andreas Henrich: Fast retrieval of high-dimensional feature vectors in P2P networks using compact peer data summaries. Multimedia Information Retrieval 2003 : 79-86 Andreas Henrich, Günter Robbert : RSV-Transfer: An Algorithm for Similarity Queries on Structured Documents. Multimedia Information Systems 2003 : 65-74 Andreas Henrich: A Relaxed Algorithm for Similarity Queries Performed with High-Dimensional Access Structures. EDBT Workshops 2002 : 376-390 Martin Eisenhardt , Andreas Henrich: Probleme und Lösungsansätze für P2P-IR-System. GI Jahrestagung 2002 : 171-175 Henrike Berthold , Frank Binkowski , Andreas Henrich, Silvia Hollfelder , Wolfgang Lindner , Ulrich Marder , Klaus Meyer-Wegener , Günter Robbert : forschungs- und entwicklungsprojekte: Architektur Multimedialer Informationssysteme. Inform., Forsch. Entwickl. 17 (2): 77-89 (2002) Oliver Haase , Andreas Henrich: Exposing the Vagueness of Query Results on Partly Inaccessible Databases. CIKM 2001 : 49-56 Andreas Henrich, Günter Robbert : An End User Retrieval Interface for Structured Multimedia Documents. Multimedia Information Systems 2001 : 71-80 Andreas Henrich, Günter Robbert : MARS: A Retrieval Service for Multimedia Authoring Environments. ADBIS-DASFAA Symposium 2000 : 88-98 Andreas Henrich, Günter Robbert : Combining Multimedia Retrieval and Text Retrieval to Search Structured Documents in Digital Libraries. DELOS Workshop: Information Seeking, Searching and Querying in Digital Libraries 2000 Oliver Haase , Andreas Henrich: A Hybrid Representation of Vague Collections for Distributed Object Management Systems. IEEE Trans. Knowl. Data Eng. 12 (2): 448-467 (2000) Oliver Haase , Andreas Henrich: A Closed Approach to Vague Collections in Partly Inaccessible Distributed Databases. ADBIS 1999 : 261-274 Andreas Henrich, Stefan Jamin : On the Optimization of Queries Containing Regular Path Expressions. NGITS 1999 : 58-75 Andreas Henrich: Applying Document Retrieval Techniques in Software Engineering Environments. DEXA 1998 : 240-249 Andreas Henrich: The LSD h -Tree: An Access Structure for Feature Vectors. ICDE 1998 : 362-369 Andreas Henrich: Reactive Environments. Wirtschaftsinformatik 40 (6): 538-540 (1998) Oliver Haase , Andreas Henrich: Query Processing Techniques for Partly Inaccessible Distributed Databases (Abstract). BNCOD 1997 : 123-125 Andreas Henrich: The Update of Index Structures in Object-Oriented DBMS. CIKM 1997 : 136-143 Andreas Henrich: Repository Based Software Cost Estimation. DEXA 1997 : 653-662 Andreas Henrich: A Common Access Structure for Standard Attributes and Document Representations in Vector Space. NGITS 1997 : 154-161 Andreas Henrich: Retrieval-Dienste für Software-Entwicklungsumgebungen (Zusammenfassung). Datenbank Rundbrief 20 : 103 (1997) Andreas Henrich: A Hybrid Split Strategy for k-d-Tree Based Access Structures. ACM-GIS 1996 : 1-8 Andreas Henrich: Adapting a Spatial Access Structure for Document Representations in Vector Space. CIKM 1996 : 19-26 Andreas Henrich, Dirk Däberitz : Using a Query Language to State Consistency Constraints for Repositories. DEXA 1996 : 59-68 Andreas Henrich, Udo Kelter : Integration von Zugriffsparadigmen in einem Repository. GI Jahrestagung 1996 : 307-326 Andreas Henrich: Improving the Performance of Multi-Dimensional Access Structures Based on k-d-Trees. ICDE 1996 : 68-75 Andreas Henrich: Document Retrieval Facilities for Repository-Based System Development Environments. SIGIR 1996 : 101-109 Andreas Henrich: Adapting the Transformation Technique to Maintain Multi-Dimensional Non-Point Objects in k-d-Tree Based Access Structures. ACM-GIS 1995 : 37-44 Andreas Henrich, Jens Möller : Die Nutzung mehrdimensionaler Zugriffsstrukturen für Anfragen über Standardattributen. BTW 1995 : 212-231 Oliver Haase , Andreas Henrich: Error Propagation in Distributed Databases. CIKM 1995 : 387-394 Andreas Henrich, Jens Möller : Extending a Spatial Access Structure to Support Additional Standard Attributes. SSD 1995 : 132-151 Andreas Henrich: A Distance Scan Algorithm for Spatial Access Structures. ACM-GIS 1994 : 136-143 Andreas Henrich, W. Johannsen , M. Kloidt : Multimediale Kundenselbstbedienung im Bankgeschäft. GI Jahrestagung 1993 : 123-129 Andreas Henrich, Andreas Hilbert , Hans-Werner Six , Peter Widmayer : Anbindung einer rämlich clusternden Zugriffstruktur für geometrische Attribute an ein Standard-Datenbanksystem am Beispiel von Oracle. BTW 1991 : 161-177 Andreas Henrich: Die Unterstützung von Nicht-Standardanfragen in geometrischen Datenbanksystemen durch räumliche Zugriffsstrukturen. Grundlagen von Datenbanken 1990 : 33-35 Andreas Henrich, Hans-Werner Six , Peter Widmayer : The LSD tree: Spatial Access to Multidimensional Point and Nonpoint Objects. VLDB 1989 : 45-53 Andreas Henrich, Hans-Werner Six , Peter Widmayer : Paging Binary Trees with External Balancing. WG 1989 : 260-276 1 [ 32 ] 2 [ 32 ] 3 [ 14 ] 4 [ 39 ] 5 [ 33 ] [ 37 ] 6 [ 8 ] [ 21 ] [ 26 ] [ 27 ] [ 31 ] 7 [ 4 ] 8 [ 32 ] 9 [ 25 ] 10 [ 5 ] 11 [ 13 ] 12 [ 5 ] 13 [ 32 ] 14 [ 32 ] 15 [ 32 ] 16 [ 7 ] [ 9 ] 17 [ 40 ] 18 [ 36 ] [ 37 ] 19 [ 28 ] [ 29 ] [ 30 ] [ 32 ] [ 35 ] [ 41 ] [ 42 ] 20 [ 1 ] [ 2 ] [ 4 ] 21 [ 1 ] [ 2 ] [ 4 ] ©2004 Association for Computing Machinery