Sciweavers

23590 search results - page 4503 / 4718
» Algorithm Performance Contest
Sort
View
SIGMOD
2007
ACM
141views Database» more  SIGMOD 2007»
16 years 5 months ago
Storage workload estimation for database management systems
Modern storage systems are sophisticated. Simple directattached storage devices are giving way to storage systems that are shared, flexible, virtualized and network-attached. Toda...
Oguzhan Ozmen, Kenneth Salem, Mustafa Uysal, M. Ho...
SIGMOD
2006
ACM
138views Database» more  SIGMOD 2006»
16 years 5 months ago
Context-sensitive ranking
The original PageRank algorithm for improving the ranking of search-query results computes a single vector, using the link structure of the Web, to capture the relative "impor...
Rakesh Agrawal, Ralf Rantzau, Evimaria Terzi
SIGMOD
2006
ACM
238views Database» more  SIGMOD 2006»
16 years 5 months ago
Continuous monitoring of top-k queries over sliding windows
Given a dataset P and a preference function f, a top-k query retrieves the k tuples in P with the highest scores according to f. Even though the problem is well-studied in convent...
Kyriakos Mouratidis, Spiridon Bakiras, Dimitris Pa...
SIGMOD
2004
ACM
156views Database» more  SIGMOD 2004»
16 years 5 months ago
Tree Logical Classes for Efficient Evaluation of XQuery
XML is widely praised for its flexibility in allowing repeated and missing sub-elements. However, this flexibility makes it challenging to develop a bulk algebra, which typically ...
Stelios Paparizos, Yuqing Wu, Laks V. S. Lakshmana...
SIGMOD
2003
ACM
136views Database» more  SIGMOD 2003»
16 years 5 months ago
A Characterization of the Sensitivity of Query Optimization to Storage Access Cost Parameters
Most relational query optimizers make use of information about the costs of accessing tuples and data structures on various storage devices. This information can at times be off b...
Frederick Reiss, Tapas Kanungo
« Prev « First page 4503 / 4718 Last » Next »