High Dimensional Spatial Indexing using Space-Filling Curves
6 Angebote vergleichen
Bester Preis: Fr. 9.75 (€ 9.99)¹ (vom 03.08.2016)1
High Dimensional Spatial Indexing using Space-Filling Curves
DE PB NW
ISBN: 9783668260122 bzw. 3668260125, in Deutsch, Grin Verlag, Taschenbuch, neu.
Lieferung aus: Deutschland, Versandkosten nach: Deutschland, Versandkostenfrei.
Von Händler/Antiquariat, buecher.de GmbH & Co. KG, [1].
Scientific Essay from the year 2015 in the subject Mathematics - Miscellaneous, language: English, abstract: Representation of two dimensional objects into one dimensional space is simple and efficient when using a two coordinate system imposed upon a grid. However, when the two dimensions are expanded far beyond visual and sometimes mental understanding, techniques are used to quantify and simplify the representation of such objects. These techniques center around spatial interpretations by means of a space-filling curve. Since the late 1800's, mathematicians and computer scientists have succeeded with algorithms that express high dimensional geometries. However, very few implementations of the algorithms beyond three dimensions for computing these geometries exist. We propose using the basic spatial computations developed by pioneers in the field like G. Peano, D. Hilbert, E. H. Moore, and others in a working model. The algorithms in this paper are fully implemented in high-level programming languages utilizing a relation database management system. We show the execution speeds of the algorithms using a space-filling curve index for searching compared to brute force searching. Finally, we contrast three space-filling curve algorithms: Moore, Hilbert, and Morton, in execution time of searching for high dimensional data in point queries and range queries. 2016. 16 S. 210 mm Versandfertig in 3-5 Tagen, Softcover, Neuware.
Von Händler/Antiquariat, buecher.de GmbH & Co. KG, [1].
Scientific Essay from the year 2015 in the subject Mathematics - Miscellaneous, language: English, abstract: Representation of two dimensional objects into one dimensional space is simple and efficient when using a two coordinate system imposed upon a grid. However, when the two dimensions are expanded far beyond visual and sometimes mental understanding, techniques are used to quantify and simplify the representation of such objects. These techniques center around spatial interpretations by means of a space-filling curve. Since the late 1800's, mathematicians and computer scientists have succeeded with algorithms that express high dimensional geometries. However, very few implementations of the algorithms beyond three dimensions for computing these geometries exist. We propose using the basic spatial computations developed by pioneers in the field like G. Peano, D. Hilbert, E. H. Moore, and others in a working model. The algorithms in this paper are fully implemented in high-level programming languages utilizing a relation database management system. We show the execution speeds of the algorithms using a space-filling curve index for searching compared to brute force searching. Finally, we contrast three space-filling curve algorithms: Moore, Hilbert, and Morton, in execution time of searching for high dimensional data in point queries and range queries. 2016. 16 S. 210 mm Versandfertig in 3-5 Tagen, Softcover, Neuware.
2
High Dimensional Spatial Indexing using Space-Filling Curves
EN NW
ISBN: 9783668260122 bzw. 3668260125, in Englisch, neu.
Lieferung aus: Deutschland, Versandfertig innerhalb von 3 Wochen.
High Dimensional Spatial Indexing using Space-Filling Curves, Scientific Essay from the year 2015 in the subject Mathematics - Miscellaneous, language: English, abstract: Representation of two dimensional objects into one dimensional space is simple and efficient when using a two coordinate system imposed upon a grid. However, when the two dimensions are expanded far beyond visual and sometimes mental understanding, techniques are used to quantify and simplify the representation of such objects. These techniques center around spatial interpretations by means of a space-filling curve. Since the late 1800's, mathematicians and computer scientists have succeeded with algorithms that express high dimensional geometries. However, very few implementations of the algorithms beyond three dimensions for computing these geometries exist. We propose using the basic spatial computations developed by pioneers in the field like G. Peano, D. Hilbert, E. H. Moore, and others in a working model. The algorithms in this paper are fully implemented in high-level programming languages utilizing a relation database management system. We show the execution speeds of the algorithms using a space-filling curve index for searching compared to brute force searching. Finally, we contrast three space-filling curve algorithms: Moore, Hilbert, and Morton, in execution time of searching for high dimensional data in point queries and range queries.
High Dimensional Spatial Indexing using Space-Filling Curves, Scientific Essay from the year 2015 in the subject Mathematics - Miscellaneous, language: English, abstract: Representation of two dimensional objects into one dimensional space is simple and efficient when using a two coordinate system imposed upon a grid. However, when the two dimensions are expanded far beyond visual and sometimes mental understanding, techniques are used to quantify and simplify the representation of such objects. These techniques center around spatial interpretations by means of a space-filling curve. Since the late 1800's, mathematicians and computer scientists have succeeded with algorithms that express high dimensional geometries. However, very few implementations of the algorithms beyond three dimensions for computing these geometries exist. We propose using the basic spatial computations developed by pioneers in the field like G. Peano, D. Hilbert, E. H. Moore, and others in a working model. The algorithms in this paper are fully implemented in high-level programming languages utilizing a relation database management system. We show the execution speeds of the algorithms using a space-filling curve index for searching compared to brute force searching. Finally, we contrast three space-filling curve algorithms: Moore, Hilbert, and Morton, in execution time of searching for high dimensional data in point queries and range queries.
3
High Dimensional Spatial Indexing using Space-Filling Curves
DE HC NW
ISBN: 9783668260122 bzw. 3668260125, in Deutsch, Grin Verlag, gebundenes Buch, neu.
Lieferung aus: Deutschland, Versandkostenfrei innerhalb von Deutschland.
Scientific Essay from the year 2015 in the subject Mathematics - Miscellaneous, language: English, abstract: Representation of two dimensional objects into one dimensional space is simple and efficient when using a two coordinate system imposed upon a grid. However, when the two dimensions are expanded far beyond visual and sometimes mental understanding, techniques are used to quantify and simplify the representation of such objects. These techniques center around spatial interpretations by Scientific Essay from the year 2015 in the subject Mathematics - Miscellaneous, language: English, abstract: Representation of two dimensional objects into one dimensional space is simple and efficient when using a two coordinate system imposed upon a grid. However, when the two dimensions are expanded far beyond visual and sometimes mental understanding, techniques are used to quantify and simplify the representation of such objects. These techniques center around spatial interpretations by means of a space-filling curve. Since the late 1800´s, mathematicians and computer scientists have succeeded with algorithms that express high dimensional geometries. However, very few implementations of the algorithms beyond three dimensions for computing these geometries exist. We propose using the basic spatial computations developed by pioneers in the field like G. Peano, D. Hilbert, E. H. Moore, and others in a working model. The algorithms in this paper are fully implemented in high-level programming languages utilizing a relation database management system. We show the execution speeds of the algorithms using a space-filling curve index for searching compared to brute force searching. Finally, we contrast three space-filling curve algorithms: Moore, Hilbert, and Morton, in execution time of searching for high dimensional data in point queries and range queries. Lieferzeit 1-2 Werktage.
Scientific Essay from the year 2015 in the subject Mathematics - Miscellaneous, language: English, abstract: Representation of two dimensional objects into one dimensional space is simple and efficient when using a two coordinate system imposed upon a grid. However, when the two dimensions are expanded far beyond visual and sometimes mental understanding, techniques are used to quantify and simplify the representation of such objects. These techniques center around spatial interpretations by Scientific Essay from the year 2015 in the subject Mathematics - Miscellaneous, language: English, abstract: Representation of two dimensional objects into one dimensional space is simple and efficient when using a two coordinate system imposed upon a grid. However, when the two dimensions are expanded far beyond visual and sometimes mental understanding, techniques are used to quantify and simplify the representation of such objects. These techniques center around spatial interpretations by means of a space-filling curve. Since the late 1800´s, mathematicians and computer scientists have succeeded with algorithms that express high dimensional geometries. However, very few implementations of the algorithms beyond three dimensions for computing these geometries exist. We propose using the basic spatial computations developed by pioneers in the field like G. Peano, D. Hilbert, E. H. Moore, and others in a working model. The algorithms in this paper are fully implemented in high-level programming languages utilizing a relation database management system. We show the execution speeds of the algorithms using a space-filling curve index for searching compared to brute force searching. Finally, we contrast three space-filling curve algorithms: Moore, Hilbert, and Morton, in execution time of searching for high dimensional data in point queries and range queries. Lieferzeit 1-2 Werktage.
4
Symbolbild
High Dimensional Spatial Indexing using Space-Filling Curves (2016)
DE PB NW RP
ISBN: 9783668260122 bzw. 3668260125, in Deutsch, GRIN Verlag Jul 2016, Taschenbuch, neu, Nachdruck.
Lieferung aus: Deutschland, Versandkostenfrei.
Von Händler/Antiquariat, AHA-BUCH GmbH [51283250], Einbeck, Germany.
This item is printed on demand - Print on Demand Neuware - 16 pp. Englisch.
Von Händler/Antiquariat, AHA-BUCH GmbH [51283250], Einbeck, Germany.
This item is printed on demand - Print on Demand Neuware - 16 pp. Englisch.
5
High Dimensional Spatial Indexing using Space-Filling Curves
~EN HC NW FE
ISBN: 3668260125 bzw. 9783668260122, vermutlich in Englisch, GRIN Publishing, gebundenes Buch, neu, Erstausgabe.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
Lade…