Sciweavers

5954 search results - page 580 / 1191
» Querying Bi-level Information
Sort
View
ICDE
2007
IEEE
192views Database» more  ICDE 2007»
16 years 8 months ago
APLA: Indexing Arbitrary Probability Distributions
The ability to store and query uncertain information is of great benefit to databases that infer values from a set of observations, including databases of moving objects, sensor r...
Vebjorn Ljosa, Ambuj K. Singh
342
Voted
ICDE
2001
IEEE
201views Database» more  ICDE 2001»
16 years 8 months ago
Approximate Nearest Neighbor Searching in Multimedia Databases
In this paper, we develop a general framework for approximate nearest neighbor queries. We categorize the current approaches for nearest neighbor query processing based on either ...
Hakan Ferhatosmanoglu, Ertem Tuncel, Divyakant Agr...
206
Voted
WWW
2007
ACM
16 years 8 months ago
From SPARQL to rules (and back)
As the data and ontology layers of the Semantic Web stack have achieved a certain level of maturity in standard recommendations such as RDF and OWL, the current focus lies on two ...
Axel Polleres
316
Voted
SIGMOD
2009
ACM
192views Database» more  SIGMOD 2009»
16 years 7 months ago
Scalable join processing on very large RDF graphs
With the proliferation of the RDF data format, engines for RDF query processing are faced with very large graphs that contain hundreds of millions of RDF triples. This paper addre...
Thomas Neumann, Gerhard Weikum
277
Voted
SIGMOD
2007
ACM
170views Database» more  SIGMOD 2007»
16 years 7 months ago
Cardinality estimation using sample views with quality assurance
Accurate cardinality estimation is critically important to high-quality query optimization. It is well known that conventional cardinality estimation based on histograms or simila...
Per-Åke Larson, Wolfgang Lehner, Jingren Zho...