11211 search results - page 2101 / 2243 » Rank-Sensitive Data Structures |
176
Voted
SIGMOD
2007
ACM
16 years 29 days ago
2007
ACM
To compensate for the inherent impedance mismatch between the relational data model (tables of tuples) and XML (ordered, unranked trees), tree join algorithms have become the prev...
197
click to vote
SIGMOD
2007
ACM
16 years 29 days ago
2007
ACM
The proliferation of database-driven web sites (or web-databases) has brought upon a plethora of applications where both Quality of Service (QoS) and Quality of Data (QoD) are of ...
194
Voted
SIGMOD
2006
ACM
16 years 29 days ago
2006
ACM
Testing of database applications is crucial for ensuring high software quality as undetected faults can result in unrecoverable data corruption. The problem of database applicatio...
204
click to vote
SIGMOD
2006
ACM
16 years 29 days ago
2006
ACM
Text is ubiquitous and, not surprisingly, many important applications rely on textual data for a variety of tasks. As a notable example, information extraction applications derive...
99
Voted
EDBT
2008
ACM
16 years 28 days ago
2008
ACM
Peer Data Management Systems (PDMSs) have been introduced as a solution to the problem of large-scale sharing of semantically rich data. A PDMS consists of semantic peers connecte...