Sciweavers

1418 search results - page 146 / 284
» A Theory of Stream Queries
Sort
View
PODS
2008
ACM
250views Database» more  PODS 2008»
14 years 9 months ago
Approximating predicates and expressive queries on probabilistic databases
We study complexity and approximation of queries in an expressive query language for probabilistic databases. The language studied supports the compositional use of confidence com...
Christoph Koch
SAT
2004
Springer
101views Hardware» more  SAT 2004»
14 years 2 months ago
An Algebraic Approach to the Complexity of Generalized Conjunctive Queries
Kolaitis and Vardi pointed out that constraint satisfaction and conjunctive query containment are essentially the same problem. We study the Boolean conjunctive queries under a mor...
Michael Bauland, Philippe Chapdelaine, Nadia Creig...
KAIS
2006
247views more  KAIS 2006»
13 years 9 months ago
XCQ: A queriable XML compression system
XML has already become the de facto standard for specifying and exchanging data on the Web. However, XML is by nature verbose and thus XML documents are usually large in size, a fa...
Wilfred Ng, Wai Yeung Lam, Peter T. Wood, Mark Lev...
COSIT
1999
Springer
162views GIS» more  COSIT 1999»
14 years 1 months ago
Terminological Default Reasoning about Spatial Information: A First Step
We extend the theory about terminological default reasoning by using a logical base language that can represent spatioterminological phenomena. Based on this description logic lang...
Ralf Möller, Michael Wessel
FCCM
2006
IEEE
137views VLSI» more  FCCM 2006»
14 years 3 months ago
Single Pass, BLAST-Like, Approximate String Matching on FPGAs
Abstract: Approximate string matching is fundamental to bioinformatics, and has been the subject of numerous FPGA acceleration studies. We address issues with respect to FPGA imple...
Martin C. Herbordt, Josh Model, Yongfeng Gu, Bhara...