2774 search results - page 507 / 555 » Exploiting Deep Structure |
207
click to vote
SIGMOD
2007
ACM
16 years 4 months 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...
236
click to vote
SIGMOD
2006
ACM
16 years 4 months 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...
207
click to vote
SIGMOD
2005
ACM
16 years 4 months ago
2005
ACM
A defining characteristic of continuous queries over on-line data streams, possibly bounded by sliding windows, is the potentially infinite and time-evolving nature of their input...
152
click to vote
SIGMOD
2004
ACM
16 years 4 months ago
2004
ACM
The prevalent use of XML highlights the need for a generic, flexible access-control mechanism for XML documents that supports efficient and secure query access, without revealing ...
142
Voted
SIGMOD
2004
ACM
16 years 4 months ago
2004
ACM
The rich dependency structure found in the columns of real-world relational databases can be exploited to great advantage, but can also cause query optimizers--which usually assum...