Sciweavers

1175 search results - page 85 / 235
» Querying by examples
Sort
View
ICDE
2009
IEEE
183views Database» more  ICDE 2009»
14 years 11 months ago
Efficient Indices Using Graph Partitioning in RDF Triple Stores
With the advance of the Semantic Web, varying RDF data were increasingly generated, published, queried, and reused via the Web. For example, the DBpedia, a community effort to extr...
Ying Yan, Chen Wang, Aoying Zhou, Weining Qian, Li...
SWAT
2000
Springer
90views Algorithms» more  SWAT 2000»
14 years 1 months ago
Efficient Expected-Case Algorithms for Planar Point Location
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
Sunil Arya, Siu-Wing Cheng, David M. Mount, Ramesh...
CISIS
2008
IEEE
14 years 4 months ago
Processing Ontology Alignments with SPARQL
Solving problems raised by heterogeneous ontologies can be achieved by matching the ontologies and processing the resulting alignments. This is typical of data mediation in which ...
Jérôme Euzenat, Axel Polleres, Fran&c...
CCGRID
2004
IEEE
14 years 1 months ago
Understanding Grid resource information management through a synthetic database benchmark/workload
Management of grid resource information is a challenging and important area considering the potential size of the grid and wide range of resources that should be represented. Thou...
Beth Plale, C. Jacobs, Scott Jensen, Ying Liu, C. ...
EDBT
2004
ACM
122views Database» more  EDBT 2004»
14 years 10 months ago
Sketch-Based Multi-query Processing over Data Streams
Abstract. Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) ...
Alin Dobra, Minos N. Garofalakis, Johannes Gehrke,...