Sciweavers

147 search results - page 29 / 30
» Size Bounds and Query Plans for Relational Joins
Sort
View
SIGMOD
1996
ACM
109views Database» more  SIGMOD 1996»
13 years 10 months ago
Improved Histograms for Selectivity Estimation of Range Predicates
Many commercial database systems maintain histograms to summarize the contents of relations and permit efficient estimation of query result sizes and access plan costs. Although s...
Viswanath Poosala, Yannis E. Ioannidis, Peter J. H...
PODS
2003
ACM
132views Database» more  PODS 2003»
14 years 5 months ago
The view selection problem for XML content based routing
We consider the view selection problem for XML content based routing: given a network, in which a stream of XML documents is routed and the routing decisions are taken based on re...
Ashish Kumar Gupta, Dan Suciu, Alon Y. Halevy
MDM
2007
Springer
125views Communications» more  MDM 2007»
13 years 12 months ago
Extending P3P/Appel for Friend Finder
FriendFinder as a location-based service collects location data from mobile users and distributes a particular user’s location upon request. Privacy of users data especially loc...
Emin Islam Tatli
VLDB
2006
ACM
190views Database» more  VLDB 2006»
14 years 6 months ago
Online summarization of dynamic time series data
Managing large-scale time series databases has attracted significant attention in the database community recently. Related fundamental problems such as dimensionality reduction, tr...
Ümit Y. Ogras, Hakan Ferhatosmanoglu
ICDT
2012
ACM
251views Database» more  ICDT 2012»
11 years 8 months ago
Computing universal models under guarded TGDs
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
André Hernich