Welcome to D
SIGMOD 2003
PODS 2003
SIGMOD-RECOR
ADBIS
CIDR 2003
CIKM 2003
DASFAA 2003
Data Enginee
DEBS
DMKD 2003
DOLAP 2003
DPDJ 2003
ER
GIS 2003
Hypertext 20
ICDE 2003
ICDM 2003
ICDT 2003
JCDL 2003
KRDB 2003
MIR 2003
MIS 2003
MMDB 2003
RIDE 2003
SBBD 2003
SIGIR 2003
SIGIR-FORUM
SIGKDD 2003
SIGKDD-EXP
SSDBM 2003
TIME 2003
TODS
VLDB 2003
VLDB Journal
WIDM 2003
About DiSC 2
Editorial Bo
Acknowledgem
DiSC 2004 Pr
ADVIS
DiSC'04 Feed
DiSC'04 Site
Search DiSC'
<<<Author Index>>>
Copyright No

Bernhard Seeger

Papers on DiSC'04


An Optimal and Progressive Algorithm for Skyline Queries

On producing join results early

A Status Report on XXL - a Software Infrastructure for Efficient Query Processing

Publications


Note: Links lead to the DBLP on the Web.

Bernhard Seeger

Michael Cammert , Christoph Heinz , Jürgen Krämer , Bernhard Seeger: Datenströme im Kontext des Verkehrsmanagements. Mobilität und Informationssysteme 2003

Jens-Peter Dittrich , Bernhard Seeger, David Scot Taylor , Peter Widmayer : On producing join results early. PODS 2003 : 134-142

Dimitris Papadias , Yufei Tao , Greg Fu , Bernhard Seeger: An Optimal and Progressive Algorithm for Skyline Queries. SIGMOD Conference 2003 : 467-478

Michael Cammert , Christoph Heinz , Jürgen Krämer , Martin Schneider , Bernhard Seeger: A Status Report on XXL - a Software Infrastructure for Efficient Query Processing. IEEE Data Eng. Bull. 26 (2): 12-18 (2003)

Donghui Zhang , Dimitrios Gunopulos , Vassilis J. Tsotras , Bernhard Seeger: Temporal and spatio-temporal aggregations over data streams using multiple time granularities. Inf. Syst. 28 (1-2): 61-84 (2003)

Donghui Zhang , Dimitrios Gunopulos , Vassilis J. Tsotras , Bernhard Seeger: Temporal Aggregation over Data Streams Using Multiple Granularities. EDBT 2002 : 646-663

Donghui Zhang , Vassilis J. Tsotras , Bernhard Seeger: Efficient Temporal Join Processing Using Indices. ICDE 2002 : 103-

Jens-Peter Dittrich , Bernhard Seeger, David Scot Taylor , Peter Widmayer : Progressive Merge Join: A Generic and Non-blocking Sort-based Join Algorithm. VLDB 2002 : 299-310

Caetano Traina Jr. , Agma J. M. Traina , Christos Faloutsos , Bernhard Seeger: Fast Indexing and Visualization of Metric Data Sets using Slim-Trees. IEEE Trans. Knowl. Data Eng. 14 (2): 244-260 (2002)

Christian S. Jensen , Markus Schneider , Bernhard Seeger, Vassilis J. Tsotras : Advances in Spatial and Temporal Databases, 7th International Symposium, SSTD 2001, Redondo Beach, CA, USA, July 12-15, 2001, Proceedings Springer 2001

Jens-Peter Dittrich , Bernhard Seeger: GESS: a scalable similarity-join algorithm for mining large data sets in high dimensional spaces. KDD 2001 : 47-56

Donghui Zhang , Alexander Markowetz , Vassilis J. Tsotras , Dimitrios Gunopulos , Bernhard Seeger: Efficient Computation of Temporal Aggregates with Range Predicates. PODS 2001

Jochen Van den Bercken , Björn Blohsfeld , Jens-Peter Dittrich , Jürgen Krämer , Tobias Schäfer , Martin Schneider , Bernhard Seeger: XXL - A Library Approach to Supporting Efficient Implementations of Advanced Database Queries. VLDB 2001 : 39-48

Jochen Van den Bercken , Bernhard Seeger: An Evaluation of Generic Bulk Loading Techniques. VLDB 2001 : 461-470

Jochen Van den Bercken , Martin Schneider , Bernhard Seeger: Plug&Join: An easy-to-use Generic Algorithm for Efficiently Processing Equi and Non-Equi Joins. EDBT 2000 : 495-509

Caetano Traina Jr. , Agma J. M. Traina , Bernhard Seeger, Christos Faloutsos : Slim-Trees: High Performance Metric Trees Minimizing Overlap Between Nodes. EDBT 2000 : 51-65

Jens-Peter Dittrich , Bernhard Seeger: Data Redundancy and Duplicate Detection in Spatial Join Processing. ICDE 2000 : 535-546

Christos Faloutsos , Bernhard Seeger, Agma J. M. Traina , Caetano Traina Jr. : Spatial Join Selectivity Using Power Laws. SIGMOD Conference 2000 : 177-188

Jochen Van den Bercken , Jens-Peter Dittrich , Bernhard Seeger: javax.XXL: A prototype for a Library of Query processing Algorithms. SIGMOD Conference 2000 : 588

Jochen Van den Bercken , Bernhard Seeger, Peter Widmayer : The Bulk Index Join: A Generic Approach to Processing Non-Equijoins. ICDE 1999 : 257

Björn Blohsfeld , Dieter Korus , Bernhard Seeger: A Comparison of Selectivity Estimators for Range Queries on Metric Attributes. SIGMOD Conference 1999 : 239-250

Jochen Van den Bercken , Bernhard Seeger, Peter Widmayer : A Generic Approach to Bulk Loading Multidimensional Index Structures. VLDB 1997 : 406-415

Thomas Brinkhoff , Hans-Peter Kriegel , Bernhard Seeger: Parallel Processing of Spatial Joins Using R-trees. ICDE 1996 : 258-265

Jochen Van den Bercken , Bernhard Seeger: Query Processing Techniques for Multiversion Access Methods. VLDB 1996 : 168-179

Bernhard Seeger: An Analysis of Schedules for Performing Multi-Page Requests. Inf. Syst. 21 (5): 387-407 (1996)

Bruno Becker , Stephan Gschwind , Thomas Ohler , Bernhard Seeger, Peter Widmayer : An Asymptotically Optimal Multiversion B-Tree. VLDB J. 5 (4): 264-275 (1996)

Thomas Brinkhoff , Hans-Peter Kriegel , Ralf Schneider , Bernhard Seeger: Multi-Step Processing of Spatial Joins. SIGMOD Conference 1994 : 197-208

Thomas Brinkhoff , Hans-Peter Kriegel , Ralf Schneider , Bernhard Seeger: GENESYS: A System for Efficient Spatial Query Processing. SIGMOD Conference 1994 : 519

Thomas Brinkhoff , Hans-Peter Kriegel , Bernhard Seeger: Efficient Processing of Spatial Joins Using R-Trees. SIGMOD Conference 1993 : 237-246

Bruno Becker , Stephan Gschwind , Thomas Ohler , Bernhard Seeger, Peter Widmayer : On Optimal Multiversion Access Structures. SSD 1993 : 123-141

Bernhard Seeger, Per-Åke Larson , Ron McFayden : Reading a Set of Disk Pages. VLDB 1993 : 592-603

Bernhard Seeger, Per-Åke Larson : Multi-Disk B-trees. SIGMOD Conference 1991 : 436-445

Bernhard Seeger: Performance Comparison of Segment Access Methods Implemented on Top of the Buddy-Tree. SSD 1991 : 277-296

Bernhard Seeger, Hans-Peter Kriegel : Design, Implementation and Performance Comparison of the Buddy-Tree. DEXA 1990 : 203-207

Norbert Beckmann , Hans-Peter Kriegel , Ralf Schneider , Bernhard Seeger: The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles. SIGMOD Conference 1990 : 322-331

Bernhard Seeger, Hans-Peter Kriegel : The Buddy-Tree: An Efficient and Robust Access Method for Spatial Data Base Systems. VLDB 1990 : 590-601

Ralf Schneider , Hans-Peter Kriegel , Bernhard Seeger, Stephan Heep : Retrieving of Parts with Geometric Similarity. FODO 1989 : 241-245

Bernhard Seeger: Der Buddy-Hashbaum: eine robuste und effiziente mehrdimensionale Zugriffsstruktur. Grundlagen von Datenbanken 1989

Hans-Peter Kriegel , Michael Schiwietz , Ralf Schneider , Bernhard Seeger: Effiziente Punkt- und Raumzugriffsstrukturen für Geo-Datenbanksysteme - Ein Leistungsvergleich. Grundlagen von Datenbanken 1989

Hans-Peter Kriegel , Bernhard Seeger: PLOP-Hashing: A Grid File without Directory. ICDE 1988 : 369-376

Stephan Heep , Hans-Peter Kriegel , Ralf Schneider , Bernhard Seeger: Konzepte zur Suche geometrisch ähnlicher Bauteile. Non-Standard Datenbanken für Anwendungen der Graphischen Datenverarbeitung 1988 : 166-183

Bernhard Seeger, Hans-Peter Kriegel : Spatial Access Methods based on Dynamic Hashing. Non-Standard Datenbanken für Anwendungen der Graphischen Datenverarbeitung 1988 : 22-36

Bernhard Seeger, Hans-Peter Kriegel : Techniques for Design and Implementation of Efficient Spatial Access Methods. VLDB 1988 : 360-371

Hans-Peter Kriegel , Bernhard Seeger: Multidimensional Dynamic Quantile Hashing is Very Efficient for Non-Uniform Record Distributions. ICDE 1987 : 10-17

Hans-Peter Kriegel , Bernhard Seeger: Multidimensional Order Preserving Linear Hashing with Partial Expansions. ICDT 1986 : 203-220

1 [ 16 ] [ 20 ]

2 [ 11 ]

3 [ 22 ] [ 24 ] [ 26 ] [ 27 ] [ 31 ] [ 32 ] [ 33 ]

4 [ 25 ] [ 33 ]

5 [ 17 ] [ 18 ] [ 19 ] [ 23 ]

6 [ 42 ] [ 45 ]

7 [ 27 ] [ 29 ] [ 33 ] [ 35 ] [ 38 ] [ 44 ]

8 [ 28 ] [ 30 ] [ 37 ]

9 [ 43 ]

10 [ 16 ] [ 20 ]

11 [ 34 ] [ 40 ] [ 41 ]

12 [ 5 ] [ 9 ]

13 [ 42 ] [ 45 ]

14 [ 36 ]

15 [ 25 ]

16 [ 33 ] [ 42 ] [ 45 ]

17 [ 1 ] [ 2 ] [ 3 ] [ 4 ] [ 5 ] [ 6 ] [ 7 ] [ 9 ] [ 10 ] [ 11 ] [ 12 ] [ 17 ] [ 18 ] [ 19 ] [ 23 ]

18 [ 14 ] [ 15 ]

19 [ 34 ]

20 [ 15 ]

21 [ 16 ] [ 20 ]

22 [ 43 ]

23 [ 33 ]

24 [ 7 ]

25 [ 36 ]

26 [ 31 ] [ 33 ] [ 42 ]

27 [ 5 ] [ 7 ] [ 9 ] [ 11 ] [ 18 ] [ 19 ]

28 [ 43 ]

29 [ 38 ] [ 44 ]

30 [ 28 ] [ 30 ] [ 37 ]

31 [ 28 ] [ 30 ] [ 37 ]

32 [ 34 ] [ 36 ] [ 39 ] [ 40 ] [ 41 ]

33 [ 16 ] [ 20 ] [ 24 ] [ 26 ] [ 38 ] [ 44 ]

34 [ 34 ] [ 39 ] [ 40 ] [ 41 ]




©2004 Association for Computing Machinery