Sciweavers

1888 search results - page 231 / 378
» Algorithms for Querying by Spatial Structure
Sort
View
VLDB
2004
ACM
119views Database» more  VLDB 2004»
14 years 9 months ago
Evaluating holistic aggregators efficiently for very large datasets
Indatawarehousingapplications,numerousOLAP queries involve the processing of holistic aggregators such as computing the "top n," median, quantiles, etc. In this paper, we...
Lixin Fu, Sanguthevar Rajasekaran
MDM
2004
Springer
154views Communications» more  MDM 2004»
14 years 2 months ago
On Bulk Loading TPR-Tree
TPR-tree is a practical index structure for moving object databases. Due to the uniform distribution assumption, TPR-tree’s bulk loading algorithm (TPR) is relatively inefficie...
Bin Lin, Jianwen Su
ERCIMDL
2009
Springer
139views Education» more  ERCIMDL 2009»
14 years 3 months ago
Geographic Information Retrieval and Digital Libraries
In this demonstration we will examine the effectiveness of Geographic Information Retrieval (GIR) methods in digital library interfaces. We will show how various types of informat...
Ray R. Larson
SODA
2010
ACM
209views Algorithms» more  SODA 2010»
14 years 6 months ago
Counting Stars and Other Small Subgraphs in Sublinear Time
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
Mira Gonen, Dana Ron, Yuval Shavitt
ESA
2007
Springer
188views Algorithms» more  ESA 2007»
14 years 3 months ago
Fast and Compact Oracles for Approximate Distances in Planar Graphs
We present an experimental evaluation of an approximate distance oracle recently suggested by Thorup [1] for undirected planar graphs. The oracle uses the existence of graph separa...
Laurent Flindt Muller, Martin Zachariasen