Sciweavers

423 search results - page 22 / 85
» Evaluating TOP-K Queries over Business Processes
Sort
View
SIGMOD
2004
ACM
164views Database» more  SIGMOD 2004»
14 years 10 months ago
Dynamic Plan Migration for Continuous Queries Over Data Streams
Dynamic plan migration is concerned with the on-the-fly transition from one continuous query plan to a semantically equivalent yet more efficient plan. Migration is important for ...
Yali Zhu, Elke A. Rundensteiner, George T. Heinema...
SEMWEB
2009
Springer
14 years 4 months ago
Functions over RDF Language Elements
Spreadsheet tools are often used in business and private scenarios in order to collect and store data, and to explore and analyze these data by executing functions and aggregation...
Bernhard Schandl
CIKM
2008
Springer
14 years 2 days ago
Modeling and exploiting query interactions in database systems
The typical workload in a database system consists of a mixture of multiple queries of different types, running concurrently and interacting with each other. Hence, optimizing per...
Mumtaz Ahmad, Ashraf Aboulnaga, Shivnath Babu, Kam...
PVLDB
2010
84views more  PVLDB 2010»
13 years 8 months ago
Processing Top-k Join Queries
We consider the problem of efficiently finding the top-k answers for join queries over web-accessible databases. Classical algorithms for finding top-k answers use branch-and-b...
Minji Wu, Laure Berti-Equille, Amélie Maria...
DL
1997
Springer
117views Digital Library» more  DL 1997»
14 years 2 months ago
Evaluating the Cost of Boolean Query Mapping
Non-uniform query languages make searching over heterogeneous information sources difficult. Our approach is to allow a user to compose Boolean queries in one rich front-end lang...
Kevin Chen-Chuan Chang, Hector Garcia-Molina