Sciweavers

1679 search results - page 45 / 336
» Pointcuts as Functional Queries
Sort
View
ICDT
2010
ACM
194views Database» more  ICDT 2010»
15 years 2 months ago
Bag Equivalence of XPath Queries
When a query is evaluated under bag semantics, each answer is returned as many times as it has derivations. Bag semantics has long been recognized as important, especially when ag...
Sara Cohen, Yaacov Y. Weiss
CIDR
2007
165views Algorithms» more  CIDR 2007»
15 years 2 months ago
A Black-Box Approach to Query Cardinality Estimation
We present a “black-box” approach to estimating query cardinality that has no knowledge of query execution plans and data distribution, yet provides accurate estimates. It doe...
Tanu Malik, Randal C. Burns, Nitesh V. Chawla
220
Voted
ICDE
2008
IEEE
336views Database» more  ICDE 2008»
16 years 2 months ago
Dominant Graph: An Efficient Indexing Structure to Answer Top-K Queries
Given a record set D and a query score function F, a top-k query returns k records from D, whose values of function F on their attributes are the highest. In this paper, we investi...
Lei Zou, Lei Chen 0002
104
Voted
ICFP
2008
ACM
16 years 21 days ago
Write it recursively: a generic framework for optimal path queries
Optimal path queries are queries to obtain an optimal path specified by a given criterion of optimality. There have been many studies to give efficient algorithms for classes of o...
Akimasa Morihata, Kiminori Matsuzaki, Masato Takei...
113
Voted
VLDB
2004
ACM
129views Database» more  VLDB 2004»
15 years 6 months ago
Probabilistic Ranking of Database Query Results
We investigate the problem of ranking answers to a database query when many tuples are returned. We adapt and apply principles of probabilistic models from Information Retrieval f...
Surajit Chaudhuri, Gautam Das, Vagelis Hristidis, ...