Sciweavers

415 search results - page 11 / 83
» Efficient Processing of Relational Queries with Sum Constrai...
Sort
View
IS
2007
15 years 5 months ago
Branch-and-bound processing of ranked queries
Despite the importance of ranked queries in numerous applications involving multi-criteria decision making, they are not efficiently supported by traditional database systems. In ...
Yufei Tao, Vagelis Hristidis, Dimitris Papadias, Y...
TKDE
2008
234views more  TKDE 2008»
15 years 5 months ago
Probabilistic Group Nearest Neighbor Queries in Uncertain Databases
The importance of query processing over uncertain data has recently arisen due to its wide usage in many real-world applications. In the context of uncertain databases, previous wo...
Xiang Lian, Lei Chen 0002
189
Voted
DEBS
2008
ACM
15 years 7 months ago
Relative temporal constraints in the Rete algorithm for complex event detection
Complex Event Processing is an important technology for information systems with a broad application space ranging from supply chain management, systems monitoring, and stock mark...
Karen Walzer, Tino Breddin, Matthias Groch
DASFAA
2004
IEEE
95views Database» more  DASFAA 2004»
15 years 9 months ago
On Incorporating Iceberg Queries in Query Processors
Iceberg queries are a special case of SQL queries involving GROUP BY and HAVING clauses, wherein the answer set is small relative to the database size. We present here a performanc...
Krishna P. Leela, Pankaj M. Tolani, Jayant R. Hari...
VLDB
2005
ACM
185views Database» more  VLDB 2005»
16 years 5 months ago
Storing and querying XML data using denormalized relational databases
XML database systems emerge as a result of the acceptance of the XML data model. Recent works have followed the promising approach of building XML database management systems on un...
Andrey Balmin, Yannis Papakonstantinou