Sciweavers

2850 search results - page 457 / 570
» Answering Queries using Humans, Algorithms and Databases
Sort
View
FOCS
2009
IEEE
15 years 8 months ago
Local Graph Partitions for Approximation and Testing
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
Avinatan Hassidim, Jonathan A. Kelner, Huy N. Nguy...
SEMWEB
2009
Springer
15 years 8 months ago
Actively Learning Ontology Matching via User Interaction
Ontology matching plays a key role for semantic interoperability. Many methods have been proposed for automatically finding the alignment between heterogeneous ontologies. However...
Feng Shi, Juanzi Li, Jie Tang, Guo Tong Xie, Hanyu...
PSSS
2003
15 years 3 months ago
Inferencing and Truth Maintenance in RDF Schema
Contrary to earlier reports in literature, exhaustive forward inferencing is a feasible approach for practical RDF. It is sufficiently fast and the increase in necessary storage s...
Jeen Broekstra, Arjohn Kampman
SIGMOD
2009
ACM
213views Database» more  SIGMOD 2009»
16 years 2 months ago
Dictionary-based order-preserving string compression for main memory column stores
Column-oriented database systems [19, 23] perform better than traditional row-oriented database systems on analytical workloads such as those found in decision support and busines...
Carsten Binnig, Stefan Hildenbrand, Franz Fär...
SSDBM
2003
IEEE
164views Database» more  SSDBM 2003»
15 years 7 months ago
Approximate String Joins
String data is ubiquitous, and its management has taken on particular importance in the past few years. Approximate queries are very important on string data especially for more c...
Divesh Srivastava