Sciweavers

223 search results - page 14 / 45
» Expressive and Efficient Peer-to-Peer Queries
Sort
View
PODS
2006
ACM
138views Database» more  PODS 2006»
14 years 6 months ago
Efficiently ordering subgoals with access constraints
d Abstract] Guizhen Yang Artificial Intelligence Center SRI International Menlo Park, CA 94025, USA Michael Kifer Dept. of Computer Science Stony Brook University Stony Brook, NY 1...
Guizhen Yang, Michael Kifer, Vinay K. Chaudhri
BIRTE
2006
133views Business» more  BIRTE 2006»
13 years 10 months ago
Leveraging Distributed Publish/Subscribe Systems for Scalable Stream Query Processing
Existing distributed publish/subscribe systems (DPSS) offer loosely coupled and easy to deploy content-based stream delivery services to a large number of users. However, the lack ...
Yongluan Zhou, Kian-Lee Tan, Feng Yu
ICDE
2006
IEEE
119views Database» more  ICDE 2006»
14 years 8 months ago
Laws for Rewriting Queries Containing Division Operators
Relational division, also known as small divide, is a derived operator of the relational algebra that realizes a many-to-one set containment test, where a set is represented as a ...
Ralf Rantzau, Christoph Mangold
SSDBM
1998
IEEE
95views Database» more  SSDBM 1998»
13 years 11 months ago
SRQL: Sorted Relational Query Language
A relation is an unordered collection of records. Often, however, there is an underlying order (e.g., a sequence of stock prices), and users want to pose queries that reflect this...
Raghu Ramakrishnan, Donko Donjerkovic, Arvind Rang...
FOIKS
2006
Springer
13 years 10 months ago
Reasoning Support for Expressive Ontology Languages Using a Theorem Prover
It is claimed in [45] that first-order theorem provers are not efficient for reasoning with ontologies based on description logics compared to specialised description logic reasone...
Ian Horrocks, Andrei Voronkov