M. J. Carey and D. Kossmann. On saying "enough already!" in SQL. In SIGMOD, pages 219--230, 1997. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents
Minimal Probing: Supporting Expensive Predicates for Top-k.. - Chang, Hwang (2002) (10 citations) (Correct)
....without efficient sorted access. Secondly, ranked queries were also proposed as a layer on top of relational databases, by defining new constructs (for returning top answers) and their processing techniques. For instance, 13] proposes new SQL clauses order by and stop after. Carey et al. [14, 15] then present optimization techniques for exploiting stop after, which limits the result cardinalities of queries. In this relational context, references [4, 5] study more general ranked queries using scoring functions. In particular, 4] exploits indices for query search, and [5] maps ranked ....
M. Carey and D. Kossmann. On saying "enough already!" in SQL. SIGMOD 1997.
Adaptive and Incremental Processing for Distance Join Queries - Shin, Moon, Lee (Correct)
....matches or reports the results incrementally in the decreasing order of well matchedness. This type of operations allow users to interact with database systems more effectively and focus on the best answers. Since users can say It is enough already at any time after obtaining the best answers [9], the waste of system resources can be reduced and thereby delivering the results to users more quickly. This ranking requirement is often combined with a spatial distance join query, and the ranking requirement provides a new opportunity of optimization for spatial distance join processing [10, ....
Michael J. Carey and Donald Kossmann. On saying "enough already!" in SQL. In Proceedings of the 1997.
On Finding a Memory Lower Bound for Query Evaluation in .. - Anciaux, Bouganim.. (2003) (Correct)
.... through large scale ad hoc sensor networks is paint in [ImN02] Sensor networks gathering weather, pollution or traffic information have motivated several recent works [MH02, BGS00] and have brought out the need for executing local computation on the data, like aggregation, sort and top n queries [CaK97], to save communication bandwidth. While sensor data are commonly delivered in a push based fashion, sensors are sometimes expected to participate in a distributed pull based query [MFH02] Personal folders on chip constitute another motivation to execute on board queries. Typically, smartcards ....
....revisit the structure of each time consuming algorithm (i.e. Join, GroupBy and Sort) with this optimization in mind. The intuition is to filter the dataflow from the leaf of the QEP to deliver only the data relevant to the computation of the current iteration in each algorithm, in the spirit of [CaK97] . We devise this optimization in the next section. 4.3 Iteration filters As mentioned earlier, the main concern in RAM lower bound is to reduce the cost incurred by reitering on the operator s input(s) Scan, Select and Project operators are not affected by this statement since they perform ....
[Article contains additional citation context not shown here]
M. J. Carey, D. Kossmann, "On Saying "Enough Already!" in SQL", Int. Conf. on Management of Data (SIGMOD), 1997.
Efficient Maintenance of Materialized Top-k Views - Yi, Yu, Yang, Xia, Chen (2003) (Correct)
....the parameters of our cost model, and demonstrates the effectiveness of our algorithm in realistic scenarios. Section 7 proposes a procedure for choosing k max which adapts to the actual system workload and performance at runtime. 2 Related Work There is a large body of work on top k queries [4, 5, 9, 10, 3, 7, 6], most of which focuses on how to evaluate these queries efficiently in various contexts. Most related to this paper is the work by Hristidis et al. 15] wherein they propose using materialized top k views to speed up more complex preference queries. Their work focuses on selecting top k views to ....
M. J. Carey and D. Kossmann. On saying "enough already!" in SQL. In Proc. of the 1997.
Adaptive and Incremental Processing for Distance Join Queries - Shin, Moon, Lee (2002) (Correct)
....matches or reports the results incrementally in the decreasing order of well matchedness. This type of operations allow users to interact with database systems more effectively and focus on the best answers. Since users can say It is enough already at any time after obtaining the best answers [9], the waste of system resources can be reduced and thereby delivering the results to users more quickly. This ranking requirement is often combined with a spatial distance join query, and the ranking requirement provides a new opportunity of optimization for spatial distance join processing [10, ....
Michael J. Carey and Donald Kossmann. On saying "enough already!" in SQL. In Proceedings of the 1997.
Nondeterministic Queries in a Relational Grid Information Service - Dinda, Lu (2003) (2 citations) (Correct)
....Only those with appropriate keys Use of Oracle is not a requirement identification mapped to database users and roles site to site (tentative) Figure 1. RGIS Structure. into database systems (Olken s dissertation [22] is a good introduction to this) reducing cardinality of results [4], and incremental queries [29] current database systems do not support these features. RGIS builds its random sampling on top of unmodified ordinary database systems using query rewriting, schema extensions, indices, and randomness. Efforts to define the broad structure of the computational ....
CAREY, M., AND KOSSMANN, D. On saying "enough already! " in sql. In ACM SIGMOD Conference (1997).
Complex Queries over Web Repositories - Raghavan, Garcia-Molina (2003) (2 citations) (Correct)
....dates, sorted list of stock prices) In contrast, our approach is based on partial orders, is intended to model user preferences , and incorporates a uniform treatment of ranking and ordering. The prune operator discussed in Section 4. 3 is similar to the STOP AFTER SQL extension proposed in [3], except that our definition extends to partially ordered relations as well. For ranked and plain relations, the semantics of prune are identical to the semantics of the STOP AFTER clause. Optimization of path queries has been studied in the object database community. However, a key difference is ....
M. Carey and D. Kossman. On saying "enough already!" in SQL. In Proc. of of the ACM SIGMOD Conf., pages 219--230, 1997.
Supporting Ad-hoc Ranking Aggregates - Chengkai Li Kevin (2006) (Correct)
No context found.
M. J. Carey and D. Kossmann. On saying "enough already!" in SQL. In SIGMOD, pages 219--230, 1997.
Online Dynamic Reordering for Interactive Data Processing - Vijayshankar Raman Bhaskaran (1999) (16 citations) (Correct)
No context found.
M. Carey and D. Kossman. On saying "enough already" in SQL. In SIGMOD, 1997.
Efficient Processing of Ad-Hoc Top-k Aggregate Queries in OLAP - Li, Chang, Ilyas (2005) (Correct)
No context found.
M. J. Carey and D. Kossmann. On saying "enough already!" in SQL. In SIGMOD, pages 219--230, 1997.
RankSQL: Query Algebra and Optimization for Relational.. - Li, Chang, Ilyas, Song (2004) (1 citation) (Correct)
No context found.
M. J. Carey and D. Kossmann. On saying "enough already!" in SQL. In SIGMOD, pages 219--230, 1997.
RankSQL: Query Algebra and Optimization for Relational.. - Li, Chang, Ilyas, Song (2005) (1 citation) (Correct)
No context found.
M. J. Carey and D. Kossmann. On saying "enough already!" in SQL. In SIGMOD, pages 219--230, 1997.
Supporting Exploratory Queries in Databases Abhijit Kadlag , .. - Dept Of Computer (Correct)
No context found.
M. Carey and D. Kossmann. On saying "enough already!" in SQL. In Proc. of SIGMOD Conf., pages 219--230, 1997.
The Paradigm of Relational Indexing: A Survey - Kriegel, Pfeifle, Pötke, Seidl (2003) (Correct)
No context found.
Michael J. Carey, Donald Kossmann: On Saying "Enough Already!" in SQL. Proc. ACM SIGMOD Int. Conf. on Management of Data: 219-230, 1997.
Memory Requirements for Query Execution in Highly - Constrained Devices Nicolas (2003) (Correct)
No context found.
M. J. Carey, D. Kossmann, "On Saying "Enough Already!" in SQL", Int. Conf. on Management of Data (SIGMOD), 1997.
Nondeterministic Queries in a Relational Grid Information.. - Peter Dinda Dong (2003) (2 citations) (Correct)
No context found.
CAREY, M., AND KOSSMANN, D. On saying "enough already! " in sql. In ACM SIGMOD Conference (1997).
Complex Queries over Web Repositories - Sriram Raghavan Hector (2003) (2 citations) (Correct)
No context found.
M. Carey and D. Kossman. On saying "enough already! " in SQL. In Proc. of of the ACM SIGMOD Conf., pages 219--230, 1997.
The Paradigm of Relational Indexing: A Survey - Kriegel, Pfeifle, Pötke, Seidl (2003) (Correct)
No context found.
Michael J. Carey, Donald Kossmann:On Saying "Enough Already!" in SQL. Proc. ACM SIGMOD Int. Conf. on Management of Data: 219-230, 1997.
Video Query Processing in the VDBMS Testbed For.. - Aref, Catlin.. (2003) (Correct)
No context found.
Michael J. Carey and Donald Kossmann, On saying "Enough already!" in SQL, In Proc. CK SIGMOD. Tucson, Arizona. May 1997.
Supporting Top-k Join Queries in Relational Databases - Ilyas, Aref, Elmagarmid (2003) (Correct)
No context found.
Michael J. Carey and Donald Kossmann. On saying "Enough already!" in SQL. In SIGMOD, Tucson, Arizona, May 1997.
Modeling and Querying Moving Objects in Networks - Güting, de Almeida (Correct)
No context found.
M. J. Carey and D. Kossmann, On Saying "Enough Already!" in SQL. In Proc. of the ACM SIGMOD Intl. Conf. on Management of Data, 1997, 219-230.
Supporting Top-k Join Queries in Relational Databases - Ilyas, Aref, Elmagarmid (Correct)
No context found.
Michael J. Carey and Donald Kossmann. On saying "Enough already!" in SQL. In SIGMOD, Tucson, Arizona, May 1997.
Efficient Integration of Query Algebra Modules into an Extensible .. - Dieker (2001) (Correct)
No context found.
M.J. Carey and D. Kossmann. On Saying "Enough Already!" in SQL. In Proc. ACM SIGMOD Conference, pp. 219--230, Tucson, 1997.
Tree Pattern Relaxation - Sihem Amer-Yahia Sihem (Correct)
No context found.
M. J. Carey and D. Kossmann. On saying "Enough Already!" in SQL. In Proceedings of the ACM SIGMOD Conference on Management of Data, 1997.
Query and Data Mapping across Heterogeneous Information Sources - Chang (2001) (Correct)
No context found.
Michael J. Carey and Donald Kossmann. On saying "enough already!" in SQL. In Proceedings of the 1997 ACM SIGMOD Conference, pages 219-230, Tucson, Arizona, 1997. ACM Press, New York.
First 50 documents
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC