294 search results - page 16 / 59 » Efficiently Processing Queries on Interval-and-Value Tuples ... |
108
Voted
WEBDB
2010
Springer
14 years 7 months ago
2010
Springer
The Semantic Web, which represents a web of knowledge, offers new opportunities to search for knowledge and information. To harvest such search power requires robust and scalable ...
171
click to vote
ICDE
2006
IEEE
15 years 10 months ago
2006
IEEE
Relational division, also known as small divide, is a derived operator of the relational algebra that realizes a many-to-one set containment test, where a set is represented as a ...
DAWAK
1999
Springer
15 years 1 months ago
1999
Springer
Efficient query processing is one of the basic needs for data mining algorithms. Clustering algorithms, association rule mining algorithms and OLAP tools all rely on efficient quer...
171
click to vote
ICDE
2006
IEEE
15 years 10 months ago
2006
IEEE
"Sparse" data, in which relations have many attributes that are null for most tuples, presents a challenge for relational database management systems. If one uses the no...
161
click to vote
SIGMOD
2006
ACM
15 years 9 months ago
2006
ACM
We study the problem of finding efficient equivalent viewbased rewritings of relational queries, focusing on query optimization using materialized views under the assumption that ...