Sciweavers

3020 search results - page 40 / 604
» Similarity Queries on Structured Data in Structured Overlays
Sort
View
PVLDB
2010
114views more  PVLDB 2010»
14 years 12 months ago
ObjectRunner: Lightweight, Targeted Extraction and Querying of Structured Web Data
We present in this paper ObjectRunner, a system for extracting, integrating and querying structured data from the Web. Our system harvests real-world items from template-based HTM...
Talel Abdessalem, Bogdan Cautis, Nora Derouiche
SEMWEB
2007
Springer
15 years 7 months ago
YARS2: A Federated Repository for Querying Graph Structured Data from the Web
We present the architecture of an end-to-end semantic search engine that uses a graph data model to enable interactive query answering over structured and interlinked data collecte...
Andreas Harth, Jürgen Umbrich, Aidan Hogan, S...
VLDB
1999
ACM
118views Database» more  VLDB 1999»
15 years 5 months ago
Similarity Search in High Dimensions via Hashing
The nearest- or near-neighbor query problems arise in a large variety of database applications, usually in the context of similarity searching. Of late, there has been increasing ...
Aristides Gionis, Piotr Indyk, Rajeev Motwani
SIAMCOMP
2012
13 years 4 months ago
An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries
Let S be a set of n intervals in R, and let (S, +) be any commutative semigroup. We assign a weight ω(s) ∈ S to each interval in S. For a point x ∈ R, let S(x) ⊆ S be the se...
Pankaj K. Agarwal, Lars Arge, Haim Kaplan, Eyal Mo...
ISAAC
2007
Springer
118views Algorithms» more  ISAAC 2007»
15 years 7 months ago
Dynamic Structures for Top- k Queries on Uncertain Data
In an uncertain data set S = (S, p, f) where S is the ground set consisting of n elements, p : S → [0, 1] a probability function, and f : S → R a score function, each element i...
Jiang Chen, Ke Yi