Sciweavers

710 search results - page 130 / 142
» Relational Expressive Power of Constraint Query Languages
Sort
View
LICS
2007
IEEE
14 years 1 months ago
Alternation-free modal mu-calculus for data trees
d abstract) Marcin Jurdzi´nski and Ranko Lazi´c∗ Department of Computer Science, University of Warwick, UK An alternation-free modal µ-calculus over data trees is introduced ...
Marcin Jurdzinski, Ranko Lazic
ICDE
2006
IEEE
208views Database» more  ICDE 2006»
14 years 1 months ago
Integrating Databases into the Semantic Web through an Ontology-Based Framework
To realize the Semantic Web, it will be necessary to make existing database content available for emerging Semantic Web applications, such as web agents and services, which use on...
Dejing Dou, Paea LePendu, Shiwoong Kim, Peishen Qi
JASIS
2000
120views more  JASIS 2000»
13 years 7 months ago
Probabilistic datalog: Implementing logical information retrieval for advanced applications
In the logical approach to information retrieval (IR), retrieval is considered as uncertain inference. Whereas classical IR models are based on propositional logic, we combine Dat...
Norbert Fuhr
CIKM
2011
Springer
12 years 7 months ago
S3K: seeking statement-supporting top-K witnesses
Traditional information retrieval techniques based on keyword search help to identify a ranked set of relevant documents, which often contains many documents in the top ranks that...
Steffen Metzger, Shady Elbassuoni, Katja Hose, Ral...
POPL
2009
ACM
14 years 2 months ago
Declarative aspects of memory management in the concurrent collections parallel programming model
Concurrent Collections (CnC)[8] is a declarative parallel language that allows the application developer to express their parallel application as a collection of high-level comput...
Zoran Budimlic, Aparna Chandramowlishwaran, Kathle...