294 search results - page 27 / 59 » Efficiently Processing Queries on Interval-and-Value Tuples ... |
289
click to vote
ICDE
2003
IEEE
16 years 7 months ago
2003
IEEE
XKeyword provides efficient keyword proximity queries on large XML graph databases. A query is simply a list of keywords and does not require any schema or query language knowledg...
274
click to vote
SIGMOD
2009
ACM
16 years 6 months ago
2009
ACM
Ranking queries are essential tools to process large amounts of probabilistic data that encode exponentially many possible deterministic instances. In many applications where unce...
167
click to vote
VLDB
1994
ACM
15 years 10 months ago
1994
ACM
A join index hierarchy method is proposed to handle the "goto's on disk" problem in objectoriented query processing. The method constructs a hierarchy of join indic...
170
click to vote
BTW
2003
Springer
15 years 11 months ago
2003
Springer
Abstract: In order to achieve efficient execution plans for queries comprising userdefined data types and predicates, the database system has to be provided with appropriate index ...
187
click to vote
CCS
2008
ACM
15 years 8 months ago
2008
ACM
We propose an approach for the selective enforcement of access control restrictions in, possibly distributed, large data collections based on two basic concepts: i) flexible autho...