Sciweavers

423 search results - page 27 / 85
» Evaluating TOP-K Queries over Business Processes
Sort
View
ICDE
2008
IEEE
127views Database» more  ICDE 2008»
14 years 11 months ago
Efficient Processing of Top-k Queries in Uncertain Databases
This work introduces novel polynomial algorithms for processing top-k queries in uncertain databases under the generally adopted model of x-relations. An x-relation consists of a n...
Ke Yi, Feifei Li, George Kollios, Divesh Srivastav...
ICDE
2005
IEEE
128views Database» more  ICDE 2005»
14 years 11 months ago
Exploiting Correlated Attributes in Acquisitional Query Processing
Sensor networks and other distributed information systems (such as the Web) must frequently access data that has a high per-attribute acquisition cost, in terms of energy, latency...
Amol Deshpande, Carlos Guestrin, Wei Hong, Samuel ...
SIGMOD
2004
ACM
119views Database» more  SIGMOD 2004»
14 years 10 months ago
Lazy Query Evaluation for Active XML
In this paper, we study query evaluation on Active XML documents (AXML for short), a new generation of XML documents that has recently gained popularity. AXML documents are XML do...
Serge Abiteboul, Omar Benjelloun, Bogdan Cautis, I...
CIKM
2009
Springer
14 years 2 months ago
Scalable indexing of RDF graphs for efficient join processing
Current approaches to RDF graph indexing suffer from weak data locality, i.e., information regarding a piece of data appears in multiple locations, spanning multiple data structur...
George H. L. Fletcher, Peter W. Beck
SEMWEB
2009
Springer
14 years 4 months ago
Conjunctive Query Answering in Distributed Ontology Systems for Ontologies with Large OWL ABoxes
We present a query processing procedure for conjunctive queries in distributed ontology systems where a large ontology is divided into ontology fragments that are later distributed...
Xueying Chen, Michel Dumontier