Sciweavers

103 search results - page 9 / 21
» Direct Algorithms for Computing the Transitive Closure of Da...
Sort
View
WWW
2003
ACM
14 years 8 months ago
On labeling schemes for the semantic web
This paper focuses on the optimization of the navigation through voluminous subsumption hierarchies of topics employed by Portal Catalogs like Netscape Open Directory (ODP). We ad...
Vassilis Christophides, Dimitris Plexousakis, Mich...
PC
2010
196views Management» more  PC 2010»
13 years 6 months ago
Solving path problems on the GPU
We consider the computation of shortest paths on Graphic Processing Units (GPUs). The blocked recursive elimination strategy we use is applicable to a class of algorithms (such as...
Aydin Buluç, John R. Gilbert, Ceren Budak
ICDE
2005
IEEE
116views Database» more  ICDE 2005»
14 years 9 months ago
RDF Aggregate Queries and Views
Resource Description Framework (RDF) is a rapidly expanding web standard. RDF databases attempt to track the massive amounts of web data and services available. In this paper, we ...
Edward Hung, Yu Deng, V. S. Subrahmanian
CIDR
2003
125views Algorithms» more  CIDR 2003»
13 years 9 months ago
Crossing the Structure Chasm
It has frequently been observed that most of the world’s data lies outside database systems. The reason is that database systems focus on structured data, leaving the unstructur...
Alon Y. Halevy, Oren Etzioni, AnHai Doan, Zachary ...
EDBT
2009
ACM
92views Database» more  EDBT 2009»
13 years 11 months ago
Efficient skyline computation in metric space
Given a set of n query points in a general metric space, a metricspace skyline (MSS) query asks what are the closest points to all these query points in the database. Here, consid...
David Fuhry, Ruoming Jin, Donghui Zhang