Sciweavers

6274 search results - page 44 / 1255
» From query complexity to computational complexity
Sort
View
LICS
1999
IEEE
14 years 2 months ago
Counting and Addition Cannot Express Deterministic Transitive Closure
An important open question in complexity theory is whether the circuit complexity class TC0 is (strictly) weaker than LOGSPACE. This paper considers this question from the viewpoi...
Matthias Ruhl
ICDT
2003
ACM
139views Database» more  ICDT 2003»
14 years 3 months ago
New Rewritings and Optimizations for Regular Path Queries
All the languages for querying semistructured data and the web use as an integral part regular expressions. Based on practical observations, finding the paths that satisfy those r...
Gösta Grahne, Alex Thomo
STACS
2007
Springer
14 years 4 months ago
Testing Convexity Properties of Tree Colorings
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
Eldar Fischer, Orly Yahalom
SIGMOD
2011
ACM
442views Database» more  SIGMOD 2011»
13 years 21 days ago
ArrayStore: a storage manager for complex parallel array processing
We present the design, implementation, and evaluation of ArrayStore, a new storage manager for complex, parallel array processing. ArrayStore builds on prior work in the area of m...
Emad Soroush, Magdalena Balazinska, Daniel L. Wang
PODS
2012
ACM
297views Database» more  PODS 2012»
12 years 10 days ago
Query-based data pricing
Data is increasingly being bought and sold online, and Webbased marketplace services have emerged to facilitate these activities. However, current mechanisms for pricing data are ...
Paraschos Koutris, Prasang Upadhyaya, Magdalena Ba...