Sciweavers

7529 search results - page 1217 / 1506
» The Modula-3 Type System
Sort
View
POPL
2008
ACM
16 years 7 months ago
Lightweight semiformal time complexity analysis for purely functional data structures
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
Nils Anders Danielsson
POPL
2007
ACM
16 years 7 months ago
A concurrent constraint handling rules implementation in Haskell with software transactional memory
Constraint Handling Rules (CHR) is a concurrent committedchoice constraint logic programming language to describe transformations (rewritings) among multi-sets of constraints (ato...
Edmund S. L. Lam, Martin Sulzmann
VLDB
2007
ACM
114views Database» more  VLDB 2007»
16 years 6 months ago
Optimization and evaluation of shortest path queries
We investigate the problem of how to evaluate efficiently a collection of shortest path queries on massive graphs that are too big to fit in the main memory. To evaluate a shortes...
Edward P. F. Chan, Heechul Lim
SIGMOD
2009
ACM
117views Database» more  SIGMOD 2009»
16 years 6 months ago
FERRY: database-supported program execution
We demonstrate the language Ferry and its editing, compilation, and execution environment FerryDeck. Ferry's type system and operations match those of scripting or programmin...
Torsten Grust, Manuel Mayr, Jan Rittinger, Tom Sch...
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
« Prev « First page 1217 / 1506 Last » Next »