Sciweavers

360 search results - page 60 / 72
» Distributed Network Querying with Bounded Approximate Cachin...
Sort
View
168
Voted
PODS
2009
ACM
119views Database» more  PODS 2009»
15 years 10 months ago
Exceeding expectations and clustering uncertain data
Database technology is playing an increasingly important role in understanding and solving large-scale and complex scientific and societal problems and phenomena, for instance, un...
Sudipto Guha, Kamesh Munagala
ISCI
2002
132views more  ISCI 2002»
14 years 9 months ago
Mobile data and transaction management
Mobile computing paradigm has emerged due to advances in wireless or cellular networking technology. This rapidly expanding technology poses many challenging research problems in ...
Sanjay Kumar Madria, Mukesh K. Mohania, Sourav S. ...
95
Voted
PODS
2007
ACM
159views Database» more  PODS 2007»
15 years 9 months ago
Generalized hypertree decompositions: np-hardness and tractable variants
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...
CIKM
2005
Springer
15 years 3 months ago
Towards estimating the number of distinct value combinations for a set of attributes
Accurately and efficiently estimating the number of distinct values for some attribute(s) or sets of attributes in a data set is of critical importance to many database operation...
Xiaohui Yu, Calisto Zuzarte, Kenneth C. Sevcik
ICDE
2005
IEEE
108views Database» more  ICDE 2005»
15 years 11 months ago
Range Efficient Computation of F0 over Massive Data Streams
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...
Pavan Aduri, Srikanta Tirthapura