Sciweavers

4714 search results - page 702 / 943
» The Complexity of Iterated Multiplication
Sort
View
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
16 years 6 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang
SIGMOD
2005
ACM
138views Database» more  SIGMOD 2005»
16 years 6 months ago
Automatic Physical Database Tuning: A Relaxation-based Approach
In recent years there has been considerable research on automated selection of physical design in database systems. In current solutions, candidate access paths are heuristically ...
Nicolas Bruno, Surajit Chaudhuri
SIGMOD
2001
ACM
121views Database» more  SIGMOD 2001»
16 years 6 months ago
XML Document Versioning
Managing multiple versions of XML documents represents an important problem, because of many applications ranging from traditional ones, such as software configuration control, to...
Shu-Yao Chien, Vassilis J. Tsotras, Carlo Zaniolo
ICSE
2004
IEEE-ACM
16 years 6 months ago
Design of Large-Scale Polylingual Systems
Abstract. Building systems from existing applications written in two or more languages is common practice. Such systems are polylingual. Polylingual systems are relatively easy to ...
Mark Grechanik, Don S. Batory, Dewayne E. Perry
ICSE
2008
IEEE-ACM
16 years 6 months ago
Creating a cognitive metric of programming task difficulty
Conducting controlled experiments about programming activities often requires the use of multiple tasks of similar difficulty. In previously reported work about a controlled exper...
Brian de Alwis, Gail C. Murphy, Shawn Minto