Sciweavers

159 search results - page 12 / 32
» Soft lambda-Calculus: A Language for Polynomial Time Computa...
Sort
View
VLDB
2007
ACM
166views Database» more  VLDB 2007»
14 years 7 months ago
Supporting Time-Constrained SQL Queries in Oracle
The growing nature of databases, and the flexibility inherent in the SQL query language that allows arbitrarily complex formulations, can result in queries that take inordinate am...
Ying Hu, Seema Sundara, Jagannathan Srinivasan
ICALP
2003
Springer
14 years 21 days ago
Generating Labeled Planar Graphs Uniformly at Random
Abstract. We present an expected polynomial time algorithm to generate a labeled planar graph uniformly at random. To generate the planar graphs, we derive recurrence formulas that...
Manuel Bodirsky, Clemens Gröpl, Mihyun Kang
EDBT
2009
ACM
208views Database» more  EDBT 2009»
14 years 2 months ago
Flexible and efficient querying and ranking on hyperlinked data sources
There has been an explosion of hyperlinked data in many domains, e.g., the biological Web. Expressive query languages and effective ranking techniques are required to convert this...
Ramakrishna Varadarajan, Vagelis Hristidis, Louiqa...
JAIR
1998
81views more  JAIR 1998»
13 years 7 months ago
Computational Aspects of Reordering Plans
This article studies the problem of modifying the action ordering of a plan in order to optimise the plan according to various criteria. One of these criteria is to make a plan le...
Christer Bäckström
ALT
1997
Springer
13 years 11 months ago
Learning One-Variable Pattern Languages Very Efficiently on Average, in Parallel, and by Asking Queries
A pattern is a string of constant and variable symbols. The language generated by a pattern is the set of all strings of constant symbols which can be obtained from by substituti...
Thomas Erlebach, Peter Rossmanith, Hans Stadtherr,...