Sciweavers

6660 search results - page 104 / 1332
» Data Analysis for Query Processing
Sort
View
CLUSTER
2005
IEEE
14 years 4 months ago
Fast Query Processing by Distributing an Index over CPU Caches
Data intensive applications on clusters often require requests quickly be sent to the node managing the desired data. In many applications, one must look through a sorted tree str...
Xiaoqin Ma, Gene Cooperman
WWW
2004
ACM
14 years 11 months ago
Remindin': semantic query routing in peer-to-peer networks based on social metaphors
In peer-to-peer networks, finding the appropriate answer for an information request, such as the answer to a query for RDF(S) data, depends on selecting the right peer in the netw...
Christoph Tempich, Steffen Staab, Adrian Wranik
SEBD
1997
134views Database» more  SEBD 1997»
13 years 12 months ago
A Systematic Approach to Multidimensional Databases
Abstract. Multidimensional databases are large collections of data, often historical, used for sophisticated analysis oriented to decision making. This activity is supported by an ...
Luca Cabibbo, Riccardo Torlone
SODA
2012
ACM
208views Algorithms» more  SODA 2012»
12 years 1 months ago
Partial match queries in random quadtrees
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the traditional model where the...
Nicolas Broutin, Ralph Neininger, Henning Sulzbach
GEOINFORMATICA
2007
223views more  GEOINFORMATICA 2007»
13 years 10 months ago
Algorithms for Nearest Neighbor Search on Moving Object Trajectories
Nearest Neighbor (NN) search has been in the core of spatial and spatiotemporal database research during the last decade. The literature on NN query processing algorithms so far d...
Elias Frentzos, Kostas Gratsias, Nikos Pelekis, Ya...