Sciweavers

2070 search results - page 26 / 414
» Querying Communities in Relational Databases
Sort
View
ADC
2004
Springer
87views Database» more  ADC 2004»
15 years 4 months ago
On the Computation of Approximations of Database Queries
Reflective Relational Machines were introduced by S. Abiteboul, C. Papadimitriou and V. Vianu in 1994, as variations of Turing machines which are suitable for the computation of ...
Flavio Antonio Ferrarotti, Jose Maria Turull Torre...
SIGMOD
2005
ACM
107views Database» more  SIGMOD 2005»
15 years 10 months ago
Relational Confidence Bounds Are Easy With The Bootstrap
Statistical estimation and approximate query processing have become increasingly prevalent applications for database systems. However, approximation is usually of little use witho...
Abhijit Pol, Chris Jermaine
SIGMOD
2010
ACM
259views Database» more  SIGMOD 2010»
15 years 2 months ago
An extensible test framework for the Microsoft StreamInsight query processor
Microsoft StreamInsight (StreamInsight, for brevity) is a platform for developing and deploying streaming applications. StreamInsight adopts a deterministic stream model that leve...
Alex Raizman, Asvin Ananthanarayan, Anton Kirilov,...
VLDB
2002
ACM
161views Database» more  VLDB 2002»
14 years 10 months ago
BANKS: Browsing and Keyword Searching in Relational Databases
The BANKS system enables keyword-based search on databases, together with data and schema browsing. BANKS enables users to extract information in a simple manner without any knowl...
B. Aditya, Gaurav Bhalotia, Soumen Chakrabarti, Ar...
ICDT
2009
ACM
173views Database» more  ICDT 2009»
15 years 11 months ago
Containment of conjunctive queries on annotated relations
We study containment and equivalence of (unions of) conjunctive queries on relations annotated with elements of a commutative semiring. Such relations and the semantics of positiv...
Todd J. Green