Sciweavers

679 search results - page 35 / 136
» Approximate Temporal Aggregation
Sort
View
ICDE
2004
IEEE
148views Database» more  ICDE 2004»
14 years 9 months ago
Approximate Selection Queries over Imprecise Data
We examine the problem of evaluating selection queries over imprecisely represented objects. Such objects are used either because they are much smaller in size than the precise on...
Iosif Lazaridis, Sharad Mehrotra
IS
2008
13 years 8 months ago
The complexity and approximation of fixing numerical attributes in databases under integrity constraints
Consistent query answering is the problem of characterizing and computing the semantically correct answers to queries from a database that may not satisfy certain integrity constr...
Leopoldo E. Bertossi, Loreto Bravo, Enrico Francon...
SIGMOD
2007
ACM
169views Database» more  SIGMOD 2007»
14 years 8 months ago
Scalable approximate query processing with the DBO engine
This paper describes query processing in the DBO database system. Like other database systems designed for ad-hoc, analytic processing, DBO is able to compute the exact answer to ...
Christopher M. Jermaine, Subramanian Arumugam, Abh...
EUSFLAT
2003
119views Fuzzy Logic» more  EUSFLAT 2003»
13 years 9 months ago
Comparison of two approaches to approximated reasoning
A comparison is made of two approaches to approximate reasoning: Mamdani's interpolation method and the implication method. Both approaches are variants of Zadeh's compo...
Pim van den Broek
SIGMOD
2004
ACM
126views Database» more  SIGMOD 2004»
14 years 8 months ago
Indexing Spatio-Temporal Trajectories with Chebyshev Polynomials
In this paper, we attempt to approximate and index a ddimensional (d 1) spatio-temporal trajectory with a low order continuous polynomial. There are many possible ways to choose ...
Yuhan Cai, Raymond T. Ng