Sciweavers

721 search results - page 4 / 145
» Supporting top-k join queries in relational databases
Sort
View
PODS
2008
ACM
123views Database» more  PODS 2008»
15 years 9 months ago
Evaluating rank joins with optimal cost
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...
Karl Schnaitter, Neoklis Polyzotis
SSDBM
2007
IEEE
118views Database» more  SSDBM 2007»
15 years 3 months ago
Database Support for Weighted Match Joins
As relational database management systems are applied to non-traditional domains such as scientific data management, there is an increasing need to support queries with semantics ...
Ameet Kini, Jeffrey F. Naughton
VLDB
1989
ACM
104views Database» more  VLDB 1989»
15 years 1 months ago
Event-Join Optimization in Temporal Relational Databases
An Event-Join combinestemporaljoin and outerjoin properties into a single operation. It is mostly used to group temporal attributes of an entity into a single relation. In this pa...
Arie Segev, Himawan Gunadhi
DASFAA
2007
IEEE
205views Database» more  DASFAA 2007»
15 years 1 months ago
Efficient Support for Ordered XPath Processing in Tree-Unaware Commercial Relational Databases
Abstract. In this paper, we present a novel ordered XPATH evaluation in treeunaware RDBMS. The novelties of our approach lies in the followings. (a) We propose a novel XML storage ...
Boon-Siew Seah, Klarinda G. Widjanarko, Sourav S. ...
SIGMOD
2001
ACM
146views Database» more  SIGMOD 2001»
15 years 9 months ago
On Supporting Containment Queries in Relational Database Management Systems
Virtually all proposals for querying XML include a class of query we term "containment queries". It is also clear that in the foreseeable future, a substantial amount of...
Chun Zhang, Jeffrey F. Naughton, David J. DeWitt, ...