default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStefan Berchtold
Person information
- affiliation: Ludwig Maximilian University of Munich, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[r2]Daniel A. Keim, Benjamin Bustos, Stefan Berchtold, Hans-Peter Kriegel:
Indexing, X-Tree. Encyclopedia of GIS 2017: 999-1004
2000 – 2009
- 2008
- [r1]Daniel A. Keim, Benjamin Bustos
, Stefan Berchtold, Hans-Peter Kriegel:
Indexing, X-Tree. Encyclopedia of GIS 2008: 543-547 - 2003
- [j6]George Kollios, Dimitrios Gunopulos, Nick Koudas, Stefan Berchtold:
Efficient Biased Sampling for Approximate Clustering and Outlier Detection in Large Data Sets. IEEE Trans. Knowl. Data Eng. 15(5): 1170-1187 (2003) - 2001
- [j5]Christian Böhm, Stefan Berchtold, Daniel A. Keim:
Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases. ACM Comput. Surv. 33(3): 322-373 (2001) - [c22]George Kollios, Dimitrios Gunopulos, Nick Koudas, Stefan Berchtold:
An Efficient Approximation Scheme for Data Mining Tasks. ICDE 2001: 453-462 - [c21]Stefan Berchtold, Christian Böhm, Daniel A. Keim, Florian Krebs, Hans-Peter Kriegel:
On Optimizing Nearest Neighbor Queries in High-Dimensional Data Spaces. ICDT 2001: 435-449 - 2000
- [j4]Stefan Berchtold, H. V. Jagadish, Kenneth A. Ross:
Independence diagrams: A technique for data visualization. J. Electronic Imaging 9(4): 375-384 (2000) - [j3]Christian Böhm, Stefan Berchtold, Hans-Peter Kriegel, Urs Michel:
Multidimensional Index Structures in Relational Databases. J. Intell. Inf. Syst. 15(1): 51-70 (2000) - [j2]Stefan Berchtold, Daniel A. Keim, Hans-Peter Kriegel, Thomas Seidl:
Indexing the Solution Space: A New Technique for Nearest Neighbor Search in High-Dimensional Space. IEEE Trans. Knowl. Data Eng. 12(1): 45-57 (2000) - [c20]Stefan Berchtold, Christian Böhm, Daniel A. Keim, Hans-Peter Kriegel, Xiaowei Xu:
Optimal Multidimensional Query Processing Using Tree Striping. DaWaK 2000: 244-257 - [c19]Stefan Berchtold, Christian Böhm, H. V. Jagadish, Hans-Peter Kriegel, Jörg Sander:
Independent Quantization: An Index Compression Technique for High-Dimensional Data Spaces. ICDE 2000: 577-588 - [c18]Stefan Berchtold, Daniel A. Keim:
Indexing High-Dimensional Spaces: Database Support for Next Decade's Applications. ICDE 2000: 698-699
1990 – 1999
- 1999
- [c17]Stefan Berchtold, Christian Böhm, Hans-Peter Kriegel, Urs Michel:
Implementation of Multidimensional Index Structures for Knowledge Discovery in Relational Databases. DaWaK 1999: 261-270 - [c16]Stefan Berchtold, Alexandros Biliris, Euthimios Panagos:
SaveMe: a system for archiving electronic documents using messaging groupware. WACC 1999: 167-176 - 1998
- [c15]Stefan Berchtold, Christian Böhm, Hans-Peter Kriegel:
Improving the Query Performance of High-Dimensional Index Structures by Bulk-Load Operations. EDBT 1998: 216-230 - [c14]Stefan Berchtold, Daniel A. Keim:
Section Coding: A Similarity Search Technique for the Car Manufacturing Industry. IADT 1998: 256-263 - [c13]Stefan Berchtold, Bernhard Ertl, Daniel A. Keim, Hans-Peter Kriegel, Thomas Seidl:
Fast Nearest Neighbor Search in High-Dimensional Space. ICDE 1998: 209-218 - [c12]Mihael Ankerst, Stefan Berchtold, Daniel A. Keim:
Similarity Clustering of Dimensions for an Enhanced Visualization of Multidimensional Data. INFOVIS 1998: 52-60 - [c11]Stefan Berchtold, H. V. Jagadish, Kenneth A. Ross:
Independence Diagrams: A Technique for Visual Data Mining. KDD 1998: 139-143 - [c10]Stefan Berchtold, Hans-Peter Kriegel, Marco Pötke:
Database Support for Concurrent Digital Mock-up. PROLAMAT 1998: 499-510 - [c9]Stefan Berchtold, Christian Böhm, Hans-Peter Kriegel:
The Pyramid-Technique: Towards Breaking the Curse of Dimensionality. SIGMOD Conference 1998: 142-153 - [c8]Stefan Berchtold, Daniel A. Keim:
High-Dimensional Index Structures, Database Support for Next Decade's Applications (Tutorial). SIGMOD Conference 1998: 501 - 1997
- [b1]Stefan Berchtold:
Geometrie-basierte Suche ähnlicher Bauteile. Ludwig Maximilians University Munich, Shaker 1997, ISBN 3-8265-2740-2, pp. 1-198 - [j1]Stefan Berchtold, Daniel A. Keim, Hans-Peter Kriegel:
Using Extended Feature Objects for Partial Similarity Retrieval. VLDB J. 6(4): 333-348 (1997) - [c7]Stefan Berchtold, Daniel A. Keim, Hans-Peter Kriegel:
Section Coding: Ein Verfahren zur Ähnlichkeitssuche in CAD-Datenbanken. BTW 1997: 152-171 - [c6]Stefan Berchtold, Christian Böhm, Daniel A. Keim, Hans-Peter Kriegel:
A Cost Model For Nearest Neighbor Search in High-Dimensional Data Space. PODS 1997: 78-86 - [c5]Stefan Berchtold, Christian Böhm, Bernhard Braunmüller, Daniel A. Keim, Hans-Peter Kriegel:
Fast Parallel Similarity Search in Multimedia Databases. SIGMOD Conference 1997: 1-12 - [c4]Stefan Berchtold, Hans-Peter Kriegel:
S3: Similarity Search in CAD Database Systems. SIGMOD Conference 1997: 564-567 - 1996
- [c3]Stefan Berchtold, Daniel A. Keim, Hans-Peter Kriegel:
The X-tree : An Index Structure for High-Dimensional Data. VLDB 1996: 28-39 - 1994
- [c2]Stefan Berchtold, Bernhard Glavina:
Kosten-Nutzen-optimale Verbesserung kollisionsfreier Roboterbewegungen mittels Polygon-Manipulation. AMS 1994: 167-178 - [c1]Stefan Berchtold, Bernhard Glavina:
A scalable optimizer for automatically generated manipulator motions. IROS 1994: 1796-1802
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:51 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
