Sciweavers

274 search results - page 26 / 55
» Computational complexity of queries based on itemsets
Sort
View
132
Voted
CSFW
2008
IEEE
15 years 10 months ago
DKAL: Distributed-Knowledge Authorization Language
DKAL is a new declarative authorization language for distributed systems. It is based on existential fixed-point logic and is considerably more expressive than existing authoriza...
Yuri Gurevich, Itay Neeman
209
Voted
VLDB
2002
ACM
113views Database» more  VLDB 2002»
16 years 3 months ago
Searching in metric spaces by spatial approximation
We propose a new data structure to search in metric spaces. A metric space is formed by a collection of objects and a distance function de ned among them, which satis es the trian...
Gonzalo Navarro
121
Voted
CIKM
1999
Springer
15 years 8 months ago
Requirement-Based Data Cube Schema Design
On-line analytical processing (OLAP) requires e cient processing of complex decision support queries over very large databases. It is well accepted that pre-computed data cubes ca...
David Wai-Lok Cheung, Bo Zhou, Ben Kao, Hongjun Lu...
162
Voted
DEXA
2005
Springer
148views Database» more  DEXA 2005»
15 years 9 months ago
XG: A Data-Driven Computation Grid for Enterprise-Scale Mining
In this paper we introduce a novel architecture for data processing, based on a functional fusion between a data and a computation layer. We show how such an architecture can be le...
Radu Sion, Ramesh Natarajan, Inderpal Narang, Wen-...
166
Voted
JACM
2008
91views more  JACM 2008»
15 years 3 months ago
On the minimization of XPath queries
XML queries are usually expressed by means of XPath expressions identifying portions of the selected documents. An XPath expression defines a way of navigating an XML tree and ret...
Sergio Flesca, Filippo Furfaro, Elio Masciari