Sciweavers

3368 search results - page 102 / 674
» The Complexity of Query Reliability
Sort
View
WEBDB
2005
Springer
97views Database» more  WEBDB 2005»
14 years 2 months ago
Towards a Query Language for Multihierarchical XML: Revisiting XPath
In recent years it has been argued that when XML encodings become complex, DOM trees are no longer adequate for query processing. Alternative representations of XML documents, suc...
Ionut Emil Iacob, Alex Dekhtyar
BTW
1993
Springer
193views Database» more  BTW 1993»
14 years 1 months ago
Query Optimization in an OODBMS
It is clearly crucial for the success of object-oriented databases to find effiĆ cient implementations that improve on the performance of relational sysĆ tems, rather than being...
Christian Rich, Marc H. Scholl
EDBTW
2004
Springer
14 years 2 months ago
FliX: A Flexible Framework for Indexing Complex XML Document Collections
While there are many proposals for path indexes on XML documents, none of them is perfectly suited for indexing large-scale collections of interlinked XML documents. Existing strat...
Ralf Schenkel
ASIAN
2005
Springer
130views Algorithms» more  ASIAN 2005»
13 years 11 months ago
A Hybrid Method for Detecting Data Stream Changes with Complex Semantics in Intensive Care Unit
Abstract. Detecting changes in data streams is very important for many applications. This paper presents a hybrid method for detecting data stream changes in intensive care unit. I...
Ting Yin, Hongyan Li, Zijing Hu, Yu Fan, Jianlong ...
LATINCRYPT
2010
13 years 7 months ago
On the Round Complexity of Zero-Knowledge Proofs Based on One-Way Permutations
We consider the following problem: can we construct constant-round zero-knowledge proofs (with negligible soundness) for NP assuming only the existence of one-way permutations? We...
S. Dov Gordon, Hoeteck Wee, David Xiao, Arkady Yer...