Clustering spatial networks for aggregate query processing: A hypergraph approach
Authors:
- Engin DemirEDEngin Demir
- Cevdet AykanatCACevdet Aykanat
- B. Barla CambazogluBCB. Barla Cambazoglu
- 1 March 2008
- journal article
- Published by Elsevier in Information Systems
- Vol. 33 (1) , 1-17
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Aggregate nearest neighbor queries in spatial databasesACM Transactions on Database Systems, 2005
- Range aggregate processing in spatial databasesIEEE Transactions on Knowledge and Data Engineering, 2004
- An efficient path computation model for hierarchically structured topographical road mapsIEEE Transactions on Knowledge and Data Engineering, 2002
- Multidimensional access methodsACM Computing Surveys, 1998
- Hierarchical encoded path views for path query processing: an optimal model and its performance evaluationIEEE Transactions on Knowledge and Data Engineering, 1998
- Two novel multiway circuit partitioning algorithms using relaxed lockingIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1997
- CCAM: a connectivity-clustered access method for networks and network computationsIEEE Transactions on Knowledge and Data Engineering, 1997
- Recent directions in netlist partitioning: a surveyIntegration, 1995
- Clustering a DAG for CAD databasesIEEE Transactions on Software Engineering, 1988
- A note on two problems in connexion with graphsNumerische Mathematik, 1959