1 resultado para One-point Quadrature
em Boston University Digital Common
Filtro por publicador
- Aberdeen University (1)
- Aberystwyth University Repository - Reino Unido (3)
- Academic Archive On-line (Jönköping University; Sweden) (1)
- Acceda, el repositorio institucional de la Universidad de Las Palmas de Gran Canaria. España (2)
- Adam Mickiewicz University Repository (1)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (5)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (2)
- Aquatic Commons (6)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (4)
- Archive of European Integration (10)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (3)
- Aston University Research Archive (16)
- Avian Conservation and Ecology - Eletronic Cientific Hournal - Écologie et conservation des oiseaux: (1)
- Biblioteca de Teses e Dissertações da USP (1)
- Biblioteca Digital | Sistema Integrado de Documentación | UNCuyo - UNCUYO. UNIVERSIDAD NACIONAL DE CUYO. (1)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (8)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (8)
- Biblioteca Digital de Teses e Dissertações Eletrônicas da UERJ (2)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (27)
- Boston University Digital Common (1)
- Brock University, Canada (6)
- Brunel University (1)
- Bucknell University Digital Commons - Pensilvania - USA (1)
- Bulgarian Digital Mathematics Library at IMI-BAS (5)
- CaltechTHESIS (2)
- Cambridge University Engineering Department Publications Database (5)
- CentAUR: Central Archive University of Reading - UK (15)
- Center for Jewish History Digital Collections (1)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (6)
- Cochin University of Science & Technology (CUSAT), India (1)
- Collection Of Biostatistics Research Archive (1)
- Corvinus Research Archive - The institutional repository for the Corvinus University of Budapest (1)
- Dalarna University College Electronic Archive (2)
- Deakin Research Online - Australia (26)
- Digital Commons @ DU | University of Denver Research (1)
- Digital Commons at Florida International University (2)
- Digital Peer Publishing (1)
- DigitalCommons@The Texas Medical Center (5)
- DigitalCommons@University of Nebraska - Lincoln (1)
- Duke University (2)
- FUNDAJ - Fundação Joaquim Nabuco (1)
- Greenwich Academic Literature Archive - UK (1)
- Harvard University (2)
- Helda - Digital Repository of University of Helsinki (7)
- Indian Institute of Science - Bangalore - Índia (50)
- Institutional Repository of Leibniz University Hannover (2)
- Instituto Politécnico do Porto, Portugal (1)
- Instituto Superior de Psicologia Aplicada - Lisboa (1)
- Lume - Repositório Digital da Universidade Federal do Rio Grande do Sul (1)
- Massachusetts Institute of Technology (2)
- National Center for Biotechnology Information - NCBI (6)
- Ohio University (1)
- Portal de Revistas Científicas Complutenses - Espanha (2)
- Publishing Network for Geoscientific & Environmental Data (6)
- QSpace: Queen's University - Canada (1)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (29)
- Queensland University of Technology - ePrints Archive (482)
- ReCiL - Repositório Científico Lusófona - Grupo Lusófona, Portugal (1)
- Repositorio Académico de la Universidad Nacional de Costa Rica (1)
- Repositório Científico do Instituto Politécnico de Lisboa - Portugal (2)
- Repositório digital da Fundação Getúlio Vargas - FGV (4)
- Repositório Institucional da Universidade de Aveiro - Portugal (2)
- Repositório Institucional da Universidade Federal de São Paulo - UNIFESP (1)
- Repositório Institucional da Universidade Federal do Rio Grande do Norte (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (74)
- Research Open Access Repository of the University of East London. (1)
- Universidad de Alicante (10)
- Universidad del Rosario, Colombia (4)
- Universidad Politécnica de Madrid (12)
- Universidade Complutense de Madrid (1)
- Universidade de Lisboa - Repositório Aberto (1)
- Universidade Federal do Pará (1)
- Universidade Federal do Rio Grande do Norte (UFRN) (6)
- Universidade Técnica de Lisboa (1)
- Universitat de Girona, Spain (3)
- Université de Lausanne, Switzerland (3)
- Université de Montréal, Canada (19)
- University of Connecticut - USA (1)
- University of Michigan (3)
- University of Queensland eSpace - Australia (2)
- University of Southampton, United Kingdom (1)
- University of Washington (2)
- WestminsterResearch - UK (2)
Resumo:
In this paper we discuss a new type of query in Spatial Databases, called Trip Planning Query (TPQ). Given a set of points P in space, where each point belongs to a category, and given two points s and e, TPQ asks for the best trip that starts at s, passes through exactly one point from each category, and ends at e. An example of a TPQ is when a user wants to visit a set of different places and at the same time minimize the total travelling cost, e.g. what is the shortest travelling plan for me to visit an automobile shop, a CVS pharmacy outlet, and a Best Buy shop along my trip from A to B? The trip planning query is an extension of the well-known TSP problem and therefore is NP-hard. The difficulty of this query lies in the existence of multiple choices for each category. In this paper, we first study fast approximation algorithms for the trip planning query in a metric space, assuming that the data set fits in main memory, and give the theory analysis of their approximation bounds. Then, the trip planning query is examined for data sets that do not fit in main memory and must be stored on disk. For the disk-resident data, we consider two cases. In one case, we assume that the points are located in Euclidean space and indexed with an Rtree. In the other case, we consider the problem of points that lie on the edges of a spatial network (e.g. road network) and the distance between two points is defined using the shortest distance over the network. Finally, we give an experimental evaluation of the proposed algorithms using synthetic data sets generated on real road networks.