958 search results - page 50 / 192 » Efficient data structures for range-aggregate queries on tre... |
217
Voted
VLDB
2007
ACM
16 years 3 months ago
2007
ACM
The performance of XML database queries can be greatly enhanced by rewriting them using materialized views. We study the problem of rewriting a query using materialized views, whe...
167
Voted
VLDB
2002
ACM
15 years 3 months ago
2002
ACM
In spite of the many decades of progress in database research, surprisingly scientists in the life sciences community still struggle with inefficient and awkward tools for queryin...
122
click to vote
MDM
2009
Springer
15 years 10 months ago
2009
Springer
Continuous queries in Wireless Sensor Networks (WSNs) are founded on the premise of Query Routing Tree structures (denoted as T), which provide sensors with a path to the querying...
230
Voted
SIGMOD
2007
ACM
16 years 3 months ago
2007
ACM
Data availability, collection and storage have increased dramatically in recent years, raising new technological and algorithmic challenges for database design and data management...
126
click to vote
CAISE
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. Data security is well-recognized a vital issue in an information system that is supported in an outsource environment. However, most of conventional XML encryption propos...