| |
 |      |
                                              |
Note: Links lead to the DBLP on the Web. Marco Pötke Hans-Peter Kriegel , Martin Pfeifle , Marco Pötke, Thomas Seidl : A Cost Model for Spatial Intersection Queries on RI-Trees. DASFAA 2004 : 331-338 Stefan Brecheisen , Hans-Peter Kriegel , Peer Kröger , Martin Pfeifle , Maximilian Viermetz , Marco Pötke: BOSS: Browsing OPTICS-Plots for Similarity Search. ICDE 2004 : 858 Hans-Peter Kriegel , Martin Pfeifle , Marco Pötke, Thomas Seidl : The Paradigm of Relational Indexing: a Survey. BTW 2003 : 285-304 Hans-Peter Kriegel , Martin Pfeifle , Marco Pötke, Matthias Renz , Thomas Seidl : Spatial Data Management for Virtual Product Development. Computer Science in Perspective 2003 : 216-230 Hans-Peter Kriegel , Martin Pfeifle , Marco Pötke, Thomas Seidl : Spatial Query Processing for High Resolutions. DASFAA 2003 : 17-26 Hans-Peter Kriegel , Peer Kröger , Zahi Mashael , Martin Pfeifle , Marco Pötke, Thomas Seidl : Effective Similarity Search on Voxelized CAD Object. DASFAA 2003 : 27- Hans-Peter Kriegel , Martin Pfeifle , Marco Pötke, Thomas Seidl : A Cost Model for Interval Intersection Queries on RI-Trees. SSDBM 2002 : 131-141 Hans-Peter Kriegel , Andreas Müller , Marco Pötke, Thomas Seidl : DIVE: Database Integration for Virtual Engineering. ICDE Demo Sessions 2001 : 15-16 Hans-Peter Kriegel , Andreas Müller , Marco Pötke, Thomas Seidl : Spatial Data Management for Computer Aided Design. SIGMOD Conference 2001 Hans-Peter Kriegel , Marco Pötke, Thomas Seidl : Interval Sequences: An Object-Relational Approach to Manage Spatial Data. SSTD 2001 : 481-501 Hans-Peter Kriegel , Marco Pötke, Thomas Seidl : Object-Relational Indexing for General Interval Relationships. SSTD 2001 : 522-542 Hans-Peter Kriegel , Marco Pötke, Thomas Seidl : Managing Intervals Efficiently in Object-Relational Databases. VLDB 2000 : 407-418 Stefan Berchtold , Hans-Peter Kriegel , Marco Pötke: Database Support for Concurrent Digital Mock-up. PROLAMAT 1998 : 499-510 1 [ 1 ] 2 [ 12 ] 3 [ 1 ] [ 2 ] [ 3 ] [ 4 ] [ 5 ] [ 6 ] [ 7 ] [ 8 ] [ 9 ] [ 10 ] [ 11 ] [ 12 ] [ 13 ] 4 [ 8 ] [ 12 ] 5 [ 8 ] 6 [ 5 ] [ 6 ] 7 [ 7 ] [ 8 ] [ 9 ] [ 10 ] [ 11 ] [ 12 ] [ 13 ] 8 [ 10 ] 9 [ 2 ] [ 3 ] [ 4 ] [ 5 ] [ 6 ] [ 7 ] [ 8 ] [ 9 ] [ 10 ] [ 11 ] [ 13 ] 10 [ 12 ]  ©2004 Association for Computing Machinery |
