2070 search results - page 335 / 414 » Querying Communities in Relational Databases |
MDM
2004
Springer
15 years 4 months ago
2004
Springer
TPR-tree is a practical index structure for moving object databases. Due to the uniform distribution assumption, TPR-tree’s bulk loading algorithm (TPR) is relatively inefficie...
IEEEMSP
2002
IEEE
15 years 4 months ago
2002
IEEE
Abstract—We present the query-by-description (QBD) component of “Kandem,” a time-aware music retrieval system. The QBD system we describe learns a relation between descriptiv...
180
click to vote
ICDE
2008
IEEE
16 years 11 days ago
2008
IEEE
Network data models are frequently used as a mechanism to describe the connectivity between spatial features in many emerging GIS applications (location-based services, transporta...
164
click to vote
ICDE
2006
IEEE
16 years 11 days ago
2006
IEEE
Updates over virtual XML views that wrap relational data are not well supported by XML data management systems. This paper studies the problem of whether a correct relational upda...
109
click to vote
PODS
2003
ACM
15 years 11 months ago
2003
ACM
Full disjunctions are an associative extension of the outerjoin operator to an arbitrary number of relations. Their main advantage is the ability to maximally combine data from di...