Sciweavers

3368 search results - page 108 / 674
» The Complexity of Query Reliability
Sort
View
ICDT
2007
ACM
114views Database» more  ICDT 2007»
14 years 3 months ago
Axiomatizing the Logical Core of XPath 2.0
The first aim of this paper is to present the logical core of XPath 2.0: a logically clean, decidable fragment, which includes most navigational features of XPath 2.0 (complex co...
Balder ten Cate, Maarten Marx
PODS
1994
ACM
138views Database» more  PODS 1994»
14 years 1 months ago
Dyn-FO: A Parallel, Dynamic Complexity Class
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
Sushant Patnaik, Neil Immerman
PODS
2012
ACM
297views Database» more  PODS 2012»
11 years 11 months 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...
WWW
2005
ACM
14 years 9 months ago
SemRank: ranking complex relationship search results on the semantic web
While the idea that querying mechanisms for complex relationships (otherwise known as Semantic Associations) should be integral to Semantic Web search technologies has recently ga...
Kemafor Anyanwu, Angela Maduko, Amit P. Sheth
ICOODB
2010
117views Database» more  ICOODB 2010»
13 years 7 months ago
iBLOB: Complex Object Management in Databases through Intelligent Binary Large Objects
Abstract. New emerging applications including genomic, multimedia, and geospatial technologies have necessitated the handling of complex application objects that are highly structu...
Tao Chen, Arif Khan, Markus Schneider, Ganesh Visw...