Sciweavers

2514 search results - page 142 / 503
» On the Computation of Approximations of Database Queries
Sort
View
MIDDLEWARE
2009
Springer
16 years 1 months ago
PAQ: Persistent Adaptive Query Middleware for Dynamic Environments
Abstract. Pervasive computing applications often entail continuous monitoring tasks, issuing persistent queries that return continuously updated views of the operational environmen...
Vasanth Rajamani, Christine Julien, Jamie Payton, ...
ICDM
2008
IEEE
222views Data Mining» more  ICDM 2008»
16 years 28 days ago
GRAPHITE: A Visual Query System for Large Graphs
We present Graphite, a system that allows the user to visually construct a query pattern, finds both its exact and approximate matching subgraphs in large attributed graphs, and ...
Duen Horng Chau, Christos Faloutsos, Hanghang Tong...
LAWEB
2005
IEEE
16 years 2 days ago
Optimized Index Structures for Querying RDF from the Web
Storing and querying Resource Description Framework (RDF) data is one of the basic tasks within any Semantic Web application. A number of storage systems provide assistance for th...
Andreas Harth, Stefan Decker
ICDE
2002
IEEE
209views Database» more  ICDE 2002»
16 years 7 months ago
Geometric-Similarity Retrieval in Large Image Bases
We propose a novel approach to shape-based image retrieval that builds upon a similarity criterion which is based on the average point set distance. Compared to traditional techni...
Ioannis Fudos, Leonidas Palios, Evaggelia Pitoura
ICDE
2010
IEEE
248views Database» more  ICDE 2010»
16 years 6 months ago
Similarity Search on Supergraph Containment
A supergraph containment search is to retrieve the data graphs contained by a query graph. In this paper, we study the problem of efficiently retrieving all data graphs approximate...
Haichuan Shang, Ke Zhu, Xuemin Lin, Ying Zhang, Ry...