Sciweavers

589 search results - page 7 / 118
» Optimized Query Evaluation Using Cooperative Sorts
Sort
View
CEC
2008
IEEE
13 years 9 months ago
Directed trees: A powerful representation for sorting and ordering problems
We present a simple framework for dealing with search spaces consisting of permutations. To demonstrate its usefulness, we build upon it a simple (1 + 1)-evolutionary algorithm fo...
Benjamin Doerr, Edda Happ
IACR
2011
111views more  IACR 2011»
12 years 7 months ago
Secure Multi-Party Sorting and Applications
Sorting is among the most fundamental and well-studied problems within computer science and a core step of many algorithms. In this article, we consider the problem of constructing...
Kristján Valur Jónsson, Gunnar Kreit...
SIGMOD
2001
ACM
221views Database» more  SIGMOD 2001»
14 years 7 months ago
Adaptable Query Optimization and Evaluation in Temporal Middleware
Time-referenced data are pervasive in most real-world databases. Recent advances in temporal query languages show that such database applications may benefit substantially from bu...
Giedrius Slivinskas, Christian S. Jensen, Richard ...
WSDM
2010
ACM
259views Data Mining» more  WSDM 2010»
14 years 4 months ago
Revisiting Globally Sorted Indexes for Efficient Document Retrieval
There has been a large amount of research on efficient document retrieval in both IR and web search areas. One important technique to improve retrieval efficiency is early termina...
Fan Zhang, Shuming Shi, Hao Yan, Ji-Rong Wen
SIGMOD
2010
ACM
364views Database» more  SIGMOD 2010»
14 years 6 days ago
Optimizing schema-last tuple-store queries in graphd
Current relational databases require that a database schema exist prior to data entry and require manual optimization for best performance. We describe the query optimization tech...
Scott M. Meyer, Jutta Degener, John Giannandrea, B...