We show that a form of divide and conquer recursion on sets, together with the relational algebra, expresses exactly the queries over ordered relational databases which are NC-computable. At a finer level, we relate k nested uses of recursion exactly to AC k , k 1. We also give corresponding results
β¦ LIBER β¦
A portable query language for small scale systems
β Scribed by M.P Papazoglou
- Publisher
- Elsevier Science
- Year
- 1988
- Weight
- 559 KB
- Volume
- 23
- Category
- Article
- ISSN
- 0165-6074
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A Query Language for NC
β
Dan Suciu; Val Tannen
π
Article
π
1997
π
Elsevier Science
π
English
β 660 KB
A graphical query language for simulatio
β
A. Oberweis; V. SΓ€nger
π
Article
π
1994
π
Elsevier Science
β 729 KB
An approximate user-complexity measure f
β
Gary W. Hansen; James V. Hansen
π
Article
π
1991
π
Elsevier Science
π
English
β 837 KB
Language portability of a speech underst
β
Mauro Cettolo; Anna Corazza; Renato De Mori
π
Article
π
1998
π
Elsevier Science
π
English
β 305 KB
An important problem in automatic speech understanding is the transport of an existing application system to a new language. Design choices are required to keep the cost and implementation time of the porting as low as possible. One of the bottlenecks in spoken language system development is represe
EquiXβA search and query language for XM
β
Sara Cohen; Yaron Kanza; Yakov Kogan; Yehoshua Sagiv; Werner Nutt; Alexander Ser
π
Article
π
2002
π
John Wiley and Sons
π
English
β 287 KB
π 1 views
A typed text retrieval query language fo
β
Dario Colazzo; Carlo Sartiani; Antonio Albano; Paolo Manghi; Giorgio Ghelli; Luc
π
Article
π
2002
π
John Wiley and Sons
π
English
β 224 KB
π 1 views