Sciweavers

2853 search results - page 49 / 571
» On the Efficiency of Provenance Queries
Sort
View
SSDBM
2010
IEEE
117views Database» more  SSDBM 2010»
15 years 2 months ago
Subspace Similarity Search: Efficient k-NN Queries in Arbitrary Subspaces
There are abundant scenarios for applications of similarity search in databases where the similarity of objects is defined for a subset of attributes, i.e., in a subspace, only. Wh...
Thomas Bernecker, Tobias Emrich, Franz Graf, Hans-...
SEBD
2008
206views Database» more  SEBD 2008»
14 years 11 months ago
Efficient and Effective Query Answering in a PDMS with SUNRISE
Abstract. Peer Data Management Systems (PDMSs) have been recently proposed as an evolution of Peer-To-Peer (P2P) systems toward a more semantics-based description of peers' co...
Federica Mandreoli, Riccardo Martoglia, Wilma Penz...
IJSWIS
2008
135views more  IJSWIS 2008»
14 years 9 months ago
Efficient Processing of RDF Queries with Nested Optional Graph Patterns in an RDBMS
Relational technology has shown to be very useful for scalable Semantic Web data management. Numerous researchers have proposed to use RDBMSs to store and query voluminous RDF dat...
Artem Chebotko, Shiyong Lu, Mustafa Atay, Farshad ...
ICDE
2007
IEEE
134views Database» more  ICDE 2007»
15 years 11 months ago
Efficient Top-k Query Evaluation on Probabilistic Data
Modern enterprise applications are forced to deal with unreliable, inconsistent and imprecise information. Probabilistic databases can model such data naturally, but SQL query eva...
Christopher Re, Nilesh N. Dalvi, Dan Suciu
SIGMOD
2007
ACM
176views Database» more  SIGMOD 2007»
15 years 10 months ago
URank: formulation and efficient evaluation of top-k queries in uncertain databases
Top-k processing in uncertain databases is semantically and computationally different from traditional top-k processing. The interplay between query scores and data uncertainty ma...
Mohamed A. Soliman, Ihab F. Ilyas, Kevin Chen-Chua...