Sciweavers

1588 search results - page 40 / 318
» Consistent query answering in databases
Sort
View
211
Voted
ICDT
2009
ACM
105views Database» more  ICDT 2009»
16 years 4 months ago
Efficient data structures for range-aggregate queries on trees
Graph-theoretic aggregation problems have been considered both in OLAP (grid graph) and XML (tree). This paper gives new results for MIN aggregation in a tree, where we want the M...
Hao Yuan, Mikhail J. Atallah
119
Voted
CSE
2009
IEEE
15 years 8 months ago
Processing Approximate Moving Range Queries in Mobile Sensor Environments
— The ubiquity of mobile devices has led to a rising demand for location-based services and applications. A major part of these services is based on the location-detection capabi...
Antoniya Petkova, Kien A. Hua, Alexander J. Aved
ICDE
2010
IEEE
176views Database» more  ICDE 2010»
15 years 4 months ago
CareDB: A context and preference-aware location-based database system
— In this paper, we aim to realize a context and preference-aware database system, CareDB, that provides scalable personalized location-based services to users based on their pre...
Justin J. Levandoski, Mohamed F. Mokbel
SIGMOD
1999
ACM
101views Database» more  SIGMOD 1999»
15 years 8 months ago
Join Synopses for Approximate Query Answering
In large data warehousing environments, it is often advantageous to provide fast, approximate answers to complex aggregate queries based on statistical summaries of the full data....
Swarup Acharya, Phillip B. Gibbons, Viswanath Poos...
SIGMOD
2005
ACM
215views Database» more  SIGMOD 2005»
16 years 4 months ago
Nested intervals tree encoding in SQL
Nested Intervals generalize Nested Sets. They are immune to hierarchy reorganization problem. They allow answering ancestor path hierarchical queries algorithmically - without acc...
Vadim Tropashko