Sciweavers

1588 search results - page 33 / 318
» Consistent query answering in databases
Sort
View
231
Voted
PODS
2009
ACM
170views Database» more  PODS 2009»
16 years 4 months ago
A general datalog-based framework for tractable query answering over ontologies
d Abstract) Andrea Cal`i2,1 , Georg Gottlob1,2 , and Thomas Lukasiewicz1, 1 Computing Laboratory, University of Oxford, UK firstname.lastname@comlab.ox.ac.uk 2 Oxford-Man Institute...
Andrea Calì, Georg Gottlob, Thomas Lukasiew...
RTSS
2006
IEEE
15 years 10 months ago
Mutual Consistency in Real-Time Databases
A real-time database is composed of real-time objects whose values remain valid only within their validity intervals. Each object in the database models a real world entity. The f...
Abhay Kumar Jha, Ming Xiong, Krithi Ramamritham
ICDE
2011
IEEE
262views Database» more  ICDE 2011»
14 years 7 months ago
Memory-constrained aggregate computation over data streams
— In this paper, we study the problem of efficiently computing multiple aggregation queries over a data stream. In order to share computation, prior proposals have suggested ins...
K. V. M. Naidu, Rajeev Rastogi, Scott Satkin, Anan...
SSDBM
2005
IEEE
115views Database» more  SSDBM 2005»
15 years 9 months ago
Using Multi-Scale Histograms to Answer Pattern Existence and Shape Match Queries
Similarity-based querying of time series data can be categorized as pattern existence queries and shape match queries. Pattern existence queries find the time series data with ce...
Lei Chen 0002, M. Tamer Özsu, Vincent Oria
ICDT
2007
ACM
126views Database» more  ICDT 2007»
15 years 10 months ago
Combining Incompleteness and Ranking in Tree Queries
Abstract. In many cases, users may want to consider incomplete answers to their queries. Often, however, there is an overwhelming number of such answers, even if subsumed answers a...
Benny Kimelfeld, Yehoshua Sagiv