Sciweavers

11 search results - page 2 / 3
» Efficient Relational Joins with Arithmetic Constraints on Mu...
Sort
View
SIGMOD
2001
ACM
136views Database» more  SIGMOD 2001»
14 years 6 months ago
Selectivity Estimation using Probabilistic Models
Estimating the result size of complex queries that involve selection on multiple attributes and the join of several relations is a difficult but fundamental task in database query...
Lise Getoor, Benjamin Taskar, Daphne Koller
SIGMOD
2001
ACM
108views Database» more  SIGMOD 2001»
14 years 6 months ago
PREFER: A System for the Efficient Execution of Multi-parametric Ranked Queries
Users often need to optimize the selection of objects by appropriately weighting the importance of multiple object attributes. Such optimization problems appear often in operation...
Vagelis Hristidis, Nick Koudas, Yannis Papakonstan...
IDEAS
2000
IEEE
96views Database» more  IDEAS 2000»
13 years 10 months ago
A Cost Function for Uniformly Partitioned UB-Trees
Most operations of the relational algebra or SQL - like projection with duplicate elimination, join, ordering, group by and aggregations - are efficiently processed using a sorted...
Volker Markl, Rudolf Bayer
BMCBI
2004
200views more  BMCBI 2004»
13 years 5 months ago
ABC: software for interactive browsing of genomic multiple sequence alignment data
Background: Alignment and comparison of related genome sequences is a powerful method to identify regions likely to contain functional elements. Such analyses are data intensive, ...
Gregory M. Cooper, Senthil A. G. Singaravelu, Aren...
WWW
2008
ACM
14 years 6 months ago
Efficiently querying rdf data in triple stores
Efficiently querying RDF [1] data is being an important factor in applying Semantic Web technologies to real-world applications. In this context, many efforts have been made to st...
Ying Yan, Chen Wang, Aoying Zhou, Weining Qian, Li...