Sciweavers

486 search results - page 87 / 98
» An Efficient Path Index for Querying Semi-structured Data
Sort
View
ICML
2007
IEEE
16 years 6 months ago
Graph clustering with network structure indices
Graph clustering has become ubiquitous in the study of relational data sets. We examine two simple algorithms: a new graphical adaptation of the k-medoids algorithm and the Girvan...
Matthew J. Rattigan, Marc Maier, David Jensen
GIS
2005
ACM
16 years 7 months ago
ASPEN: an adaptive spatial peer-to-peer network
Geographic Information Systems (GIS) are increasingly managing very large sets of data and hence a centralized data repository may not always provide the most scalable solution. H...
Haojun Wang, Roger Zimmermann, Wei-Shinn Ku
NSDI
2004
15 years 7 months ago
Contract-Based Load Management in Federated Distributed Systems
This paper focuses on load management in looselycoupled federated distributed systems. We present a distributed mechanism for moving load between autonomous participants using bil...
Magdalena Balazinska, Hari Balakrishnan, Michael S...
JIDM
2010
155views more  JIDM 2010»
15 years 4 months ago
DeweyIDs - The Key to Fine-Grained Management of XML Documents
Because XML documents tend to be very large and are more and more collaboratively processed, their fine-grained storage and management is a must for which, in turn, a flexible tree...
Michael Peter Haustein, Theo Härder, Christia...
VLDB
2004
ACM
125views Database» more  VLDB 2004»
15 years 11 months ago
Reverse kNN Search in Arbitrary Dimensionality
Given a point q, a reverse k nearest neighbor (RkNN) query retrieves all the data points that have q as one of their k nearest neighbors. Existing methods for processing such quer...
Yufei Tao, Dimitris Papadias, Xiang Lian