Sciweavers

179 search results - page 20 / 36
» Fixed-Point Query Languages for Linear Constraint Databases
Sort
View
SIGIR
2004
ACM
14 years 1 months ago
Multiple sources of evidence for XML retrieval
Document-centric XML collections contain text-rich documents, marked up with XML tags. The tags add lightweight semantics to the text. Querying such collections calls for a hybrid...
Börkur Sigurbjörnsson, Jaap Kamps, Maart...
PODS
2003
ACM
118views Database» more  PODS 2003»
14 years 7 months ago
Numerical document queries
A query against a database behind a site like Napster may search, e.g., for all users who have downloaded more jazz titles than pop music titles. In order to express such queries,...
Helmut Seidl, Thomas Schwentick, Anca Muscholl
SIGMOD
2012
ACM
234views Database» more  SIGMOD 2012»
11 years 10 months ago
BloomUnit: declarative testing for distributed programs
We present BloomUnit, a testing framework for distributed programs written in the Bloom language. BloomUnit allows developers to write declarative test specifications that descri...
Peter Alvaro, Andrew Hutchinson, Neil Conway, Will...
SIGMOD
2003
ACM
154views Database» more  SIGMOD 2003»
14 years 7 months ago
The Cougar Project: a work-in-progress report
We present an update on the status of the Cougar Sensor Database Project, in which we are investigating a database approach to sensor networks: Clients "program" the sen...
Alan J. Demers, Johannes Gehrke, Rajmohan Rajarama...
FOCS
1998
IEEE
13 years 12 months ago
The Complexity of Acyclic Conjunctive Queries
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
Georg Gottlob, Nicola Leone, Francesco Scarcello