The retrieval of direction relations using R-trees

Dimitris Papadias; Yannis Theodoridis; Timos Sellis

doi:10.1007/3-540-58435-8_182

The retrieval of direction relations using R-trees

Dimitris Papadias, Yannis Theodoridis, Timos Sellis

Research output: Chapter in Book/Conference Proceeding/Report › Conference Paper published in a book › peer-review

26 Citations (Scopus)

Abstract

R-trees and related structures, like R⁺-trees and R^*- trees, have been used to answer queries involving topological information about objects represented by their minimum bounding rectangles (MBRs). This paper describes how the R-tree method can be used for the storage and retrieval of direction relations. Direction relations deal with order in space, as for instance, left, above, north, southeast etc. In this paper we define direction relations between points and extend the definitions to relations between objects. Then we present our tests regarding the retrieval of direction relations between objects using R-trees and discuss the representational properties of MBR approximations with respect to directions in 2D space.

Original language	English
Title of host publication	Database and Expert Systems Applications - 5th International Conference, DEXA 1994, Proceedings
Editors	Dimitris Karagiannis
Publisher	Springer Verlag
Pages	173-182
Number of pages	10
ISBN (Print)	9783540584353
DOIs	https://doi.org/10.1007/3-540-58435-8_182
Publication status	Published - 1994
Externally published	Yes
Event	5th International Conference Database and Expert Systems Applications, DEXA 1994 - Athens, Greece Duration: 7 Sept 1994 → 9 Sept 1994

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	856 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	5th International Conference Database and Expert Systems Applications, DEXA 1994
Country/Territory	Greece
City	Athens
Period	7/09/94 → 9/09/94

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1994.

Access to Document

10.1007/3-540-58435-8_182

Cite this

Papadias, D., Theodoridis, Y., & Sellis, T. (1994). The retrieval of direction relations using R-trees. In D. Karagiannis (Ed.), Database and Expert Systems Applications - 5th International Conference, DEXA 1994, Proceedings (pp. 173-182). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 856 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-58435-8_182

Papadias, Dimitris ; Theodoridis, Yannis ; Sellis, Timos. / The retrieval of direction relations using R-trees. Database and Expert Systems Applications - 5th International Conference, DEXA 1994, Proceedings. editor / Dimitris Karagiannis. Springer Verlag, 1994. pp. 173-182 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{57752c5af63b4bb0b6964cef42eb05c3,

title = "The retrieval of direction relations using R-trees",

abstract = "R-trees and related structures, like R+-trees and R*- trees, have been used to answer queries involving topological information about objects represented by their minimum bounding rectangles (MBRs). This paper describes how the R-tree method can be used for the storage and retrieval of direction relations. Direction relations deal with order in space, as for instance, left, above, north, southeast etc. In this paper we define direction relations between points and extend the definitions to relations between objects. Then we present our tests regarding the retrieval of direction relations between objects using R-trees and discuss the representational properties of MBR approximations with respect to directions in 2D space.",

author = "Dimitris Papadias and Yannis Theodoridis and Timos Sellis",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1994.; 5th International Conference Database and Expert Systems Applications, DEXA 1994 ; Conference date: 07-09-1994 Through 09-09-1994",

year = "1994",

doi = "10.1007/3-540-58435-8\_182",

language = "English",

isbn = "9783540584353",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "173--182",

editor = "Dimitris Karagiannis",

booktitle = "Database and Expert Systems Applications - 5th International Conference, DEXA 1994, Proceedings",

}

Papadias, D, Theodoridis, Y & Sellis, T 1994, The retrieval of direction relations using R-trees. in D Karagiannis (ed.), Database and Expert Systems Applications - 5th International Conference, DEXA 1994, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 856 LNCS, Springer Verlag, pp. 173-182, 5th International Conference Database and Expert Systems Applications, DEXA 1994, Athens, Greece, 7/09/94. https://doi.org/10.1007/3-540-58435-8_182

The retrieval of direction relations using R-trees. / Papadias, Dimitris; Theodoridis, Yannis; Sellis, Timos.
Database and Expert Systems Applications - 5th International Conference, DEXA 1994, Proceedings. ed. / Dimitris Karagiannis. Springer Verlag, 1994. p. 173-182 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 856 LNCS).

Research output: Chapter in Book/Conference Proceeding/Report › Conference Paper published in a book › peer-review

TY - GEN

T1 - The retrieval of direction relations using R-trees

AU - Papadias, Dimitris

AU - Theodoridis, Yannis

AU - Sellis, Timos

PY - 1994

Y1 - 1994

N2 - R-trees and related structures, like R+-trees and R*- trees, have been used to answer queries involving topological information about objects represented by their minimum bounding rectangles (MBRs). This paper describes how the R-tree method can be used for the storage and retrieval of direction relations. Direction relations deal with order in space, as for instance, left, above, north, southeast etc. In this paper we define direction relations between points and extend the definitions to relations between objects. Then we present our tests regarding the retrieval of direction relations between objects using R-trees and discuss the representational properties of MBR approximations with respect to directions in 2D space.

AB - R-trees and related structures, like R+-trees and R*- trees, have been used to answer queries involving topological information about objects represented by their minimum bounding rectangles (MBRs). This paper describes how the R-tree method can be used for the storage and retrieval of direction relations. Direction relations deal with order in space, as for instance, left, above, north, southeast etc. In this paper we define direction relations between points and extend the definitions to relations between objects. Then we present our tests regarding the retrieval of direction relations between objects using R-trees and discuss the representational properties of MBR approximations with respect to directions in 2D space.

UR - https://openalex.org/W1592776862

UR - https://www.scopus.com/pages/publications/85007022930

U2 - 10.1007/3-540-58435-8_182

DO - 10.1007/3-540-58435-8_182

M3 - Conference Paper published in a book

SN - 9783540584353

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 173

EP - 182

BT - Database and Expert Systems Applications - 5th International Conference, DEXA 1994, Proceedings

A2 - Karagiannis, Dimitris

PB - Springer Verlag

T2 - 5th International Conference Database and Expert Systems Applications, DEXA 1994

Y2 - 7 September 1994 through 9 September 1994

ER -

Papadias D, Theodoridis Y, Sellis T. The retrieval of direction relations using R-trees. In Karagiannis D, editor, Database and Expert Systems Applications - 5th International Conference, DEXA 1994, Proceedings. Springer Verlag. 1994. p. 173-182. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-58435-8_182

The retrieval of direction relations using R-trees

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this