Sciweavers

2514 search results - page 202 / 503
» On the Computation of Approximations of Database Queries
Sort
View
PODS
2002
ACM
138views Database» more  PODS 2002»
16 years 6 months ago
Fast Algorithms For Hierarchical Range Histogram Construction
Data Warehousing and OLAPapplications typically view data as having multiple logical dimensions e.g., product, location with natural hierarchies de ned on each dimension. OLAP que...
Sudipto Guha, Nick Koudas, Divesh Srivastava
AMW
2010
15 years 8 months ago
On the Decidability of Consistent Query Answering
Abstract. Consistent query answering (CQA) is about formally characterizing and computing semantically correct answers to queries posed to a database that may fail to satisfy certa...
Marcelo Arenas, Leopoldo E. Bertossi
ATAL
2008
Springer
15 years 8 months ago
Self-interested database managers playing the view maintenance game
A database view is a dynamic virtual table composed of the result set of a query, often executed over different underlying databases. The view maintenance problem concerns how a v...
Hala Mostafa, Victor R. Lesser, Gerome Miklau
ADC
2006
Springer
120views Database» more  ADC 2006»
16 years 18 days ago
Approximate data mining in very large relational data
In this paper we discuss eNERF, an extended version of non-Euclidean relational fuzzy c-means (NERFCM) for approximate clustering in very large (unloadable) relational data. The e...
James C. Bezdek, Richard J. Hathaway, Christopher ...
ICDE
2009
IEEE
159views Database» more  ICDE 2009»
16 years 1 months ago
ApproxRank: Estimating Rank for a Subgraph
Abstract— Customized semantic query answering, personalized search, focused crawlers and localized search engines frequently focus on ranking the pages contained within a subgrap...
Yao Wu, Louiqa Raschid