Sciweavers

179 search results - page 27 / 36
» Fixed-Point Query Languages for Linear Constraint Databases
Sort
View
PETRA
2009
ACM
14 years 2 months ago
Towards faster activity search using embedding-based subsequence matching
Event search is the problem of identifying events or activity of interest in a large database storing long sequences of activity. In this paper, our topic is the problem of identi...
Panagiotis Papapetrou, Paul Doliotis, Vassilis Ath...
ICDT
2010
ACM
259views Database» more  ICDT 2010»
14 years 5 months ago
Forward-XPath and extended register automata on data-trees
We consider a fragment of XPath named `forward-XPath', which contains all descendant and rightwards sibling axes as well as data equality and inequality tests. The satisfiabi...
Diego Figueira
DEBS
2011
ACM
12 years 11 months ago
Declarative data-driven coordination
Many data-driven social and Web applications involve collaboration and coordination. The vision of declarative data-driven coordination (D3C), proposed in [9], is to support coord...
Johannes Gehrke
MOBIDE
2006
ACM
14 years 1 months ago
Towards correcting input data errors probabilistically using integrity constraints
Mobile and pervasive applications frequently rely on devices such as RFID antennas or sensors (light, temperature, motion) to provide them information about the physical world. Th...
Nodira Khoussainova, Magdalena Balazinska, Dan Suc...
ICTL
1994
13 years 11 months ago
Abduction in Temporal Reasoning
Commonsense knowledge often omits the temporal incidence of facts, and even the ordering between occurrences is only available for some of their instances. Reasoning about the temp...
Cristina Ribeiro, António Porto