Sciweavers

3020 search results - page 76 / 604
» Similarity Queries on Structured Data in Structured Overlays
Sort
View
ICDT
1995
ACM
96views Database» more  ICDT 1995»
15 years 9 months ago
On Two Forms of Structural Recursion
We investigate and compare two forms of recursion on sets for querying nested collections. The rst one is called sri and it corresponds to sequential processing of data. The second...
Dan Suciu, Limsoon Wong
DBISP2P
2005
Springer
172views Database» more  DBISP2P 2005»
15 years 12 months ago
A Content-Addressable Network for Similarity Search in Metric Spaces
In this paper we present a scalable and distributed access structure for similarity search in metric spaces. The approach is based on the Content– addressable Network (CAN) parad...
Fabrizio Falchi, Claudio Gennaro, Pavel Zezula
COMPGEOM
2010
ACM
15 years 11 months ago
Orthogonal range reporting: query lower bounds, optimal structures in 3-d, and higher-dimensional improvements
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...
Peyman Afshani, Lars Arge, Kasper Dalgaard Larsen
GIS
2009
ACM
15 years 11 months ago
Data structures and intersection algorithms for 3D spatial data types
Apart from visualization tasks, three-dimensional (3D) data management features are not or only hardly available in current spatial database systems and Geographic Information Sys...
Tao Chen, Markus Schneider
LAWEB
2005
IEEE
15 years 12 months ago
Optimized Index Structures for Querying RDF from the Web
Storing and querying Resource Description Framework (RDF) data is one of the basic tasks within any Semantic Web application. A number of storage systems provide assistance for th...
Andreas Harth, Stefan Decker