Sciweavers

2853 search results - page 50 / 571
» On the Efficiency of Provenance Queries
Sort
View
SIGMOD
2004
ACM
127views Database» more  SIGMOD 2004»
15 years 10 months ago
Efficient Query Reformulation in Peer-Data Management Systems
Peer data management systems (PDMS) offer a flexible architecture for decentralized data sharing. In a PDMS, every peer is associated with a schema that represents the peer's...
Igor Tatarinov, Alon Y. Halevy
VLDB
1998
ACM
105views Database» more  VLDB 1998»
15 years 1 months ago
Computing Iceberg Queries Efficiently
Many applications compute aggregate functions over an attribute (or set of attributes) to find aggregate values above some specified threshold. We call such queries iceberg querie...
Min Fang, Narayanan Shivakumar, Hector Garcia-Moli...
ADC
2000
Springer
182views Database» more  ADC 2000»
15 years 1 months ago
Efficient Range Query Retrieval for Non-Uniform Data Distributions
Answering range queries is a common database operation. Methods based on hashing techniques to minimise the cost of answering range queries by taking the query distribution into a...
Salahadin Mohammed, Evan P. Harris, Kotagiri Ramam...
CCS
2008
ACM
14 years 11 months ago
Assessing query privileges via safe and efficient permission composition
We propose an approach for the selective enforcement of access control restrictions in, possibly distributed, large data collections based on two basic concepts: i) flexible autho...
Sabrina De Capitani di Vimercati, Sara Foresti, Su...
IS
2007
14 years 9 months ago
Efficient processing of XPath queries using indexes
: A number of indexing techniques have been proposed in recent times for optimizing the queries on XML and other semistructured data models. Most of the semistructured models use t...
Sanjay Kumar Madria, Yan Chen, Kalpdrum Passi, Sou...