Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 3 of 3 for “"very large spatial databases"”.

  1. Shortest Path Queries in Very Large Spatial Databases

    … the graph totally reside in the main memory. Howevery, for very large graphs, such as the digital maps managed by Geographic Information Systems (GIS), the requirement cannot be satisfied in most cases, so the algorithms mentioned above are not appropriate. My objective in this thesis is to design …

    waterloo Repository record for Shortest Path Queries in Very Large Spatial Databases (opens in a new tab)

  2. Optimal Path Queries in Very Large Spatial Databases

    … Recently, due to the need of applications in very large graphs, such as the digital maps managed by Geographic Information Systems (GIS), several disk-based algorithms have been derived by using divide-and-conquer techniques to solve the shortest path problem in a very large graph. However, …

    waterloo Repository record for Optimal Path Queries in Very Large Spatial Databases (opens in a new tab)

  3. Τεχνικές εξόρυξης σύνθετων τύπων δεδομένων

    … in the fields of automatic data collection, very large databases, and data warehouses from heterogeneous data sources, resulted to very large volumes of data. The analysis of such volumes is not feasible without the aid of the efficient and semi-automatic methods of data mining. Recently, …

    greece Repository record for Τεχνικές εξόρυξης σύνθετων τύπων δεδομένων (opens in a new tab)