Sciweavers

2514 search results - page 9 / 503
» On the Computation of Approximations of Database Queries
Sort
View
SIGMOD
2008
ACM
236views Database» more  SIGMOD 2008»
14 years 7 months ago
Approximate embedding-based subsequence matching of time series
A method for approximate subsequence matching is introduced, that significantly improves the efficiency of subsequence matching in large time series data sets under the dynamic ti...
Vassilis Athitsos, Panagiotis Papapetrou, Michalis...
WWW
2009
ACM
14 years 8 months ago
Answering approximate queries over autonomous web databases
To deal with the problem of empty or too little answers returned from a Web database in response to a user query, this paper proposes a novel approach to provide relevant and rank...
Xiangfu Meng, Z. M. Ma, Li Yan
PPAM
2005
Springer
14 years 26 days ago
Parallel Query Processing and Edge Ranking of Graphs
Abstract. In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorit...
Dariusz Dereniowski, Marek Kubale
EDBT
2004
ACM
113views Database» more  EDBT 2004»
14 years 7 months ago
Hippo: A System for Computing Consistent Answers to a Class of SQL Queries
Jan Chomicki, Jerzy Marcinkowski, Slawomir Stawork...