Sciweavers

185 search results - page 15 / 37
» Precise complexity analysis for efficient datalog queries
Sort
View
CSFW
2004
IEEE
15 years 3 months ago
Cassandra: Flexible Trust Management, Applied to Electronic Health Records
We study the specification of access control policy in large-scale distributed systems. We present Cassandra, a language and system for expressing policy, and the results of a sub...
Moritz Y. Becker, Peter Sewell
DAGSTUHL
2004
15 years 1 months ago
The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Y...
WWW
2005
ACM
16 years 10 days ago
A fast XPATH evaluation technique with the facility of updates
This paper addresses the problem of fast retrieval of data from XML documents by providing a labeling schema that can easily handle simple as well as complex XPATH queries and als...
Ashish Virmani, Suchit Agarwal, Rahul Thathoo, She...
EOR
2006
117views more  EOR 2006»
14 years 11 months ago
Heuristics for selecting robust database structures with dynamic query patterns
The success of a company increasingly depends on timely information (internal or external) being available to the right person at the right time for crucial managerial decision-ma...
Andrew N. K. Chen, Paulo B. Goes, Alok Gupta, Jame...
103
Voted
WEBI
2007
Springer
15 years 5 months ago
Improving Performance of Web Services Query Matchmaking with Automated Knowledge Acquisition
There is a critical need to design and develop tools tract away the fundamental complexity of XML-based Web services specifications and toolkits, and provide an elegant, intuitive...
Chaitali Gupta, Rajdeep Bhowmik, Michael R. Head, ...