Sciweavers

1465 search results - page 232 / 293
» Making database systems usable
Sort
View
SIGMOD
2010
ACM
249views Database» more  SIGMOD 2010»
15 years 7 months ago
Active knowledge: dynamically enriching RDF knowledge bases by web services
The proliferation of knowledge-sharing communities and the advances in information extraction have enabled the construction of large knowledge bases using the RDF data model to re...
Nicoleta Preda, Gjergji Kasneci, Fabian M. Suchane...
VLDB
1997
ACM
126views Database» more  VLDB 1997»
15 years 6 months ago
Dynamic Memory Adjustment for External Mergesort
Sorting is a memory intensive operation whose performance is greatly affected by the amount of memory available as work space. When the input size is unknown or available memory s...
Weiye Zhang, Per-Åke Larson
144
Voted
ICDT
2010
ACM
180views Database» more  ICDT 2010»
15 years 6 months ago
Composing local-as-view mappings: closure and applications
Schema mapping composition is a fundamental operation in schema management and data exchange. The mapping composition problem has been extensively studied for a number of mapping ...
Patricia C. Arocena, Ariel Fuxman, Renée J....
ICDT
2010
ACM
163views Database» more  ICDT 2010»
15 years 1 months ago
Composing Local-As-View Mappings
Schema mapping composition is a fundamental operation in schema management and data exchange. The mapping composition problem has been extensively studied for a number of mapping ...
Patricia Arocena, Ariel Fuxman, Renee Miller
CIKM
2010
Springer
15 years 1 months ago
Fast and accurate estimation of shortest paths in large graphs
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...