Sciweavers

2217 search results - page 141 / 444
» Rank-aware Query Optimization
Sort
View
ICDE
2003
IEEE
148views Database» more  ICDE 2003»
16 years 7 months ago
Efficient Computation of Subqueries in Complex OLAP
Expressing complex OLAP queries using group-by, aggregation, and joins can be extremely difficult. As a result of this, many alternate ways of expressing such queries have been de...
Michael H. Böhlen, Michael O. Akinde
ICDE
2006
IEEE
134views Database» more  ICDE 2006»
16 years 7 months ago
ISOMER: Consistent Histogram Construction Using Query Feedback
Database columns are often correlated, so that cardinality estimates computed by assuming independence often lead to a poor choice of query plan by the optimizer. Multidimensional...
Utkarsh Srivastava, Peter J. Haas, Volker Markl, M...
TDM
2004
174views Database» more  TDM 2004»
15 years 7 months ago
Relational Approach to Logical Query Optimization of XPath
To be able to handle the ever growing volumes of XML documents, effective and efficient data management solutions are needed. Managing XML data in a relational DBMS has great pote...
Maurice van Keulen
WWW
2009
ACM
16 years 7 months ago
Quicklink selection for navigational query results
Quicklinks for a website are navigational shortcuts displayed below the website homepage on a search results page, and that let the users directly jump to selected points inside t...
Deepayan Chakrabarti, Ravi Kumar, Kunal Punera
SSD
2007
Springer
243views Database» more  SSD 2007»
16 years 12 days ago
Continuous Medoid Queries over Moving Objects
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
Stavros Papadopoulos, Dimitris Sacharidis, Kyriako...