Sciweavers

1018 search results - page 95 / 204
» On the minimization of XPath queries
Sort
View
SSDBM
2005
IEEE
184views Database» more  SSDBM 2005»
15 years 7 months ago
Optimizing Multiple Top-K Queries over Joins
Advanced Data Mining applications require more and more support from relational database engines. Especially clustering applications in high dimensional features space demand a pr...
Dirk Habich, Wolfgang Lehner, Alexander Hinneburg
SSD
2005
Springer
105views Database» more  SSD 2005»
15 years 7 months ago
Evaluation of Top-k OLAP Queries Using Aggregate R-Trees
Abstract. A top-k OLAP query groups measures with respect to some abstraction level of interesting dimensions and selects the k groups with the highest aggregate value. An example ...
Nikos Mamoulis, Spiridon Bakiras, Panos Kalnis
110
Voted
SEMWEB
2004
Springer
15 years 7 months ago
Top-k Query Evaluation for Schema-Based Peer-to-Peer Networks
Abstract. Increasing the number of peers in a peer-to-peer network usually increases the number of answers to a given query as well. While having more answers is nice in principle,...
Wolfgang Nejdl, Wolf Siberski, Uwe Thaden, Wolf-Ti...
ICDCS
2007
IEEE
15 years 5 months ago
Efficient Execution of Continuous Incoherency Bounded Queries over Multi-Source Streaming Data
On-line decision making often involves query processing over time-varying data which arrives in the form of data streams from distributed locations. In such environments typically...
Manish Bhide, Krithi Ramamritham, Mukund Agrawal
DEXA
2008
Springer
113views Database» more  DEXA 2008»
15 years 3 months ago
Optimal Preference Elicitation for Skyline Queries over Categorical Domains
When issuing user-specific queries, users often have a vaguely defined information need. Skyline queries identify the most "interesting" objects for users' incomplet...
Jongwuk Lee, Gae-won You, Seung-won Hwang, Joachim...