Sciweavers

349 search results - page 3 / 70
» Recursive Path Orderings Can Also Be Incremental
Sort
View
DASFAA
2007
IEEE
151views Database» more  DASFAA 2007»
13 years 8 months ago
On Label Stream Partition for Efficient Holistic Twig Join
Label stream partition is a useful technique to reduce the input I/O cost of holistic twig join by pruning useless streams beforehand. The Prefix Path Stream (PPS) partition scheme...
Bo Chen, Tok Wang Ling, M. Tamer Özsu, Zhenzh...
CADE
2006
Springer
14 years 5 months ago
Partial Recursive Functions in Higher-Order Logic
Abstract. Based on inductive definitions, we develop an automated tool for defining partial recursive functions in Higher-Order Logic and providing appropriate reasoning tools for ...
Alexander Krauss
CPC
1999
105views more  CPC 1999»
13 years 4 months ago
Total Path Length For Random Recursive Trees
Total path length, or search cost, for a rooted tree is defined as the sum of all root-to-node distances. Let Tn be the total path length for a random recursive tree of order n. M...
Robert P. Dobrow, James Allen Fill
ICDE
2009
IEEE
130views Database» more  ICDE 2009»
14 years 6 months ago
Recursive Computation of Regions and Connectivity in Networks
In recent years, the data management community has begun to consider situations in which data access is closely tied to network routing and distributed acquisition: examples includ...
Mengmeng Liu, Nicholas E. Taylor, Wenchao Zhou, Za...
FOSSACS
2009
Springer
13 years 11 months ago
On Global Model Checking Trees Generated by Higher-Order Recursion Schemes
Higher-order recursion schemes are systems of rewrite rules on typed non-terminal symbols, which can be used to define infinite trees. The Global Modal Mu-Calculus Model Checking...
Christopher Broadbent, C.-H. Luke Ong