Sciweavers

2070 search results - page 256 / 414
» Querying Communities in Relational Databases
Sort
View
SIGMOD
2011
ACM
222views Database» more  SIGMOD 2011»
14 years 9 months ago
Data generation using declarative constraints
We study the problem of generating synthetic databases having declaratively specified characteristics. This problem is motivated by database system and application testing, data ...
Arvind Arasu, Raghav Kaushik, Jian Li
SIGMOD
2002
ACM
112views Database» more  SIGMOD 2002»
16 years 6 months ago
Minimal probing: supporting expensive predicates for top-k queries
This paper addresses the problem of evaluating ranked top-? queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries...
Kevin Chen-Chuan Chang, Seung-won Hwang
PODS
2008
ACM
170views Database» more  PODS 2008»
16 years 6 months ago
Answering aggregate queries in data exchange
Data exchange, also known as data translation, has been extensively investigated in recent years. One main direction of research has focused on the semantics and the complexity of...
Foto N. Afrati, Phokion G. Kolaitis
ICDE
2010
IEEE
273views Database» more  ICDE 2010»
16 years 6 months ago
WikiAnalytics: Ad-hoc Querying of Highly Heterogeneous Structured Data
Searching and extracting meaningful information out of highly heterogeneous datasets is a hot topic that received a lot of attention. However, the existing solutions are based on e...
Andrey Balmin, Emiran Curtmola
VLDB
2004
ACM
227views Database» more  VLDB 2004»
15 years 11 months ago
Approximate NN queries on Streams with Guaranteed Error/performance Bounds
In data stream applications, data arrive continuously and can only be scanned once as the query processor has very limited memory (relative to the size of the stream) to work with...
Nick Koudas, Beng Chin Ooi, Kian-Lee Tan, Rui Zhan...