Sciweavers

2217 search results - page 115 / 444
» Rank-aware Query Optimization
Sort
View
150
Voted
SIGECOM
2003
ACM
107views ECommerce» more  SIGECOM 2003»
15 years 10 months ago
Using value queries in combinatorial auctions
Combinatorial auctions, where bidders can bid on bundles of items are known to be desirable auction mechanisms for selling items that are complementary and/or substitutable. Howev...
Benoît Hudson, Tuomas Sandholm
IAT
2010
IEEE
15 years 3 months ago
Selecting Operator Queries Using Expected Myopic Gain
When its human operator cannot continuously supervise (much less teleoperate) an agent, the agent should be able to recognize its limitations and ask for help when it risks making...
Robert Cohn, Michael Maxim, Edmund H. Durfee, Sati...
EDBT
2009
ACM
132views Database» more  EDBT 2009»
15 years 12 months ago
A novel approach for efficient supergraph query processing on graph databases
In recent years, large amount of data modeled by graphs, namely graph data, have been collected in various domains. Efficiently processing queries on graph databases has attracted...
Shuo Zhang, Jianzhong Li, Hong Gao, Zhaonian Zou
151
Voted
WISE
2002
Springer
15 years 10 months ago
RAL: an Algebra for Querying RDF
To make the World Wide Web machine-understandable there is a strong demand both for languages describing metadata and for languages querying metadata. The Resource Description Fram...
Flavius Frasincar, Geert-Jan Houben, Richard Vdovj...
SIGMOD
2004
ACM
148views Database» more  SIGMOD 2004»
16 years 5 months ago
Vertical and Horizontal Percentage Aggregations
Existing SQL aggregate functions present important limitations to compute percentages. This article proposes two SQL aggregate functions to compute percentages addressing such lim...
Carlos Ordonez