721 search results - page 23 / 145 » Supporting top-k join queries in relational databases |
168
click to vote
ICDE
2002
IEEE
15 years 11 months ago
2002
IEEE
XML queries typically specify patterns of selection predicates on multiple elements that have some specified tree structured relationships. The primitive tree structured relations...
103
Voted
EDBT
2010
ACM
14 years 11 months ago
2010
ACM
Keyword-based search in relational databases allows users to discover relevant information without knowing the database schema or using complicated queries. However, such searches...
SIGMOD
2010
ACM
15 years 2 months ago
2010
ACM
Online aggregation is a promising solution to achieving fast early responses for interactive ad-hoc queries that compute aggregates on a large amount of data. Essential to the suc...
DEXA
2000
Springer
15 years 2 months ago
2000
Springer
This paper describes a new benchmark for object-relational DBMSs, the Benchmark for Object-Relational Databases (BORD). BORD has been developed to evaluate system performance pecul...
ICDE
2010
IEEE
15 years 9 months ago
2010
IEEE
A fundamental problem in XML query processing is tree pattern query (TPQ) matching which computes all data instances in an XML database that match an input TPQ. There is a lot of r...