Filters








51,771 Hits in 4.1 sec

Pushing Feature Selection ahead of Join [chapter]

Rong She, Ke Wang, Yabo Xu, Philip S. Yu
2005 Proceedings of the 2005 SIAM International Conference on Data Mining  
In this paper, we present a way of performing feature selection through class propagation, eliminating the need of join before feature selection.  ...  1 Current approaches for feature selection on multiple data sources need to join all data in order to evaluate features against the class label, thus are not scalable and involve unnecessary information  ...  In other words, we push the process of feature selection ahead of the join operation.  ... 
doi:10.1137/1.9781611972757.56 dblp:conf/sdm/SheWXY05 fatcat:vbz776xk2fhhxpptbrbvl6y5fi

Aspect Refinement — Unifying AOP and Stepwise Refinement

Sven Apel, Christian Kästner, Thomas Leich, Gunter Saake
2007 Journal of Object Technology  
all kinds of structural elements of aspects in a uniform way (methods, pointcuts, advice).  ...  To underpin our proposal, we contribute a fully functional compiler on top of AspectJ, present a non-trivial, medium-sized case study, and derive a set of programming guidelines.  ...  We thank Don Batory, William Cook, Christian Lengauer, and Roberto Lopez-Herrejon for their insightful comments on earlier drafts of this paper.  ... 
doi:10.5381/jot.2007.6.9.a1 fatcat:efbhebi3treothyt6gbpn5qp2m

Optimization of object-oriented recursive queries using cost-controlled strategies

Rosana S. G. Lanzelotte, Patrick Valduriez, Mohamed Zaït
1992 Proceedings of the 1992 ACM SIGMOD international conference on Management of data - SIGMOD '92  
as soon as possible, according to the relational heuristics of pushing selection through join.  ...  The strategy of transformPT below starts by pushing selective operations, such as selection or join, through recursion using the filter action.  ... 
doi:10.1145/130283.130322 dblp:conf/sigmod/LanzelotteVZ92 fatcat:qrdcrvk73jhhbpycf3slacv4hu

Optimization of object-oriented recursive queries using cost-controlled strategies

Rosana S. G. Lanzelotte, Patrick Valduriez, Mohamed Zaït
1992 SIGMOD record  
as soon as possible, according to the relational heuristics of pushing selection through join.  ...  The strategy of transformPT below starts by pushing selective operations, such as selection or join, through recursion using the filter action.  ... 
doi:10.1145/141484.130322 fatcat:evckrprkcjem5irk75ad3fumca

Steaming ahead

K. S. Jayaraman
2007 Nature  
Both play important roles in the formation of the Indian monsoon, and both contain underwater geological features of interest -such as the Southwest Indian Ridge, where oceanic plates are pulling apart  ...  Now Indian researchers are pushing beyond this traditional base, with a $100-million-a-year drive deeper into their own waters and farther afield to the poles (see 'Push for the poles').  ...  Push for the poles  ... 
doi:10.1038/448642a pmid:17687298 fatcat:brdqoxy7jvat5llhtlewjfhr7y

Magpie: Python at Speed and Scale using Cloud Backends

Alekh Jindal, K. Venkatesh Emani, Maureen Daum, Olga Poppe, Brandon Haynes, Anna Pavlenko, Ayushi Gupta, Karthik Ramachandra, Carlo Curino, Andreas Mueller, Wentao Wu, Hiren Patel
2021 Conference on Innovative Data Systems Research  
Furthermore, databases offer enterprise-grade features (e.g., transactions, fine-grained access control, tamper-proof logging, encryption) as well as a mature ecosystem of tools in modern clouds.  ...  We describe a system we are building, coined Magpie, which exposes the popular Pandas API while lazily pushing large chunks of computation into scalable, efficient, and secured database engines.  ...  For simplicity, we hereafter refer to programs that use the Pandas PyFroid currently handles selections, projections, feature additions, joins, and aggregations.  ... 
dblp:conf/cidr/JindalEDPHPG0CM21 fatcat:2u57cgl4wfar5bepjispc3on4y

Columnar Storage in SQL Server 2012

Per-Åke Larson, Eric N. Hanson, Susan L. Price
2012 IEEE Data Engineering Bulletin  
These two features together greatly improve the performance of typical data warehouse queries, in some cases by two orders of magnitude.  ...  This improves I/O performance and makes more efficient use of memory. Column store indexes are fully integrated into the system.  ...  For example, we currently push some filters into the column store scan; customers would like us to match or exceed the range of filter types that are pushed in row-mode queries.  ... 
dblp:journals/debu/LarsonHP12 fatcat:34yggxj35fclzofrhqqdavij5q

SeRViSO

Carlos Eduardo Lenz, Lau Cheuk Lung, Frank Augusto Siqueira
2010 Proceedings of the 2010 ACM Symposium on Applied Computing - SAC '10  
Novel in this technique is the explicit handling of losses with a selective retransmission mechanism based on H.264 content, controlled by estimated decoding importance of packets.  ...  Several works proposed methods to make video streaming scalable over the number of clients, avoiding the linear growth of bandwidth requirements for the media source node.  ...  The priority and selection is based upon H.264 features: the NALU header, detailed in section 3.  ... 
doi:10.1145/1774088.1774231 dblp:conf/sac/LenzLS10 fatcat:mjdfi2xf6zdijjfpwmj6zaprji

SQL server column store indexes

Per-Åke Larson, Cipri Clinciu, Eric N. Hanson, Artem Oks, Susan L. Price, Srikumar Rangarajan, Aleksandras Surna, Qingqing Zhou
2011 Proceedings of the 2011 international conference on Management of data - SIGMOD '11  
The SQL Server 11 release (code named "Denali") introduces a new data warehouse query acceleration feature based on a new index type called a column store index.  ...  a broad range of decision support queries.  ...  ACKNOWLEDGMENTS Many other people have contributed to the success of this project.  ... 
doi:10.1145/1989323.1989448 dblp:conf/sigmod/LarsonCHOPRSZ11 fatcat:ars4o7shurclfhchfg3rbz6iay

Progressive result generation for multi-criteria decision support queries

Venkatesh Raghavan, Elke A. Rundensteiner
2010 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010)  
However, state-of-the-art techniques either focus on handling skylines on single input sets (i.e., no joins) or do not tackle the challenge of producing progressive early output results.  ...  In ProgXe the query processing (join, mapping and skyline) is conducted at multiple levels of abstraction, thereby exploiting the knowledge gained from both input as well as mapped output spaces.  ...  sets or very high join selectivity [9] .  ... 
doi:10.1109/icde.2010.5447928 dblp:conf/icde/RaghavanR10 fatcat:j7ehjnsz2rcqvkcqxmftrfweqy

Federated Stream Processing Support for Real-Time Business Intelligence Applications [chapter]

Irina Botan, Younggoo Cho, Roozbeh Derakhshan, Nihal Dindar, Laura Haas, Kihong Kim, Nesime Tatbul
2010 Lecture Notes in Business Information Processing  
We show preliminary results on usefulness and performance of the MaxStream architecture on the SAP Sales and Distribution Benchmark.  ...  However, we see much richer possibilities ahead; this minimal set of features is only a necessary first step that allows us to test the feasibility of our proposed architecture (Section 5).  ...  As we look ahead, several important areas of research loom.  ... 
doi:10.1007/978-3-642-14559-9_2 fatcat:th6gzxbhsvb6xmxry6nbt27olm

Synchronized Content and Metadata Management in a Federation of Distributed Repositories of Chemical Learning Objects [chapter]

Sergio Tasso, Simonetta Pallottelli, Osvaldo Gervasi, Razvan Tanase, Marina Rui
2017 Lecture Notes in Computer Science  
Additional elements of evaluation are the capability of enhancing collaboration and fault tolerance.  ...  The paper deals with the synchronization mechanism among the servers of a federation of distributed repositories for the constant updating of the didactic-scientific material, its properties and its locations  ...  Thanks are due also to EGI and IGI and the related COMPCHEM VO for the use of Grid resources.  ... 
doi:10.1007/978-3-319-62398-6_2 fatcat:csnfp3qn55edblzspfqsddgtma

Top-k Linked Data Query Processing [chapter]

Andreas Wagner, Thanh Tran Duc, Günter Ladwig, Andreas Harth, Rudi Studer
2012 Lecture Notes in Computer Science  
One line of research targets the so-called top-k join problem, where the k best final results are obtained through joining partial results.  ...  Further, we elaborate on strategies for a better estimation of scores of unprocessed join results (to obtain tighter bounds for early termination) and for an aggressive pruning of partial results.  ...  Conclusion We discussed how existing top-k join techniques can be adapted to the Linked Data context.  ... 
doi:10.1007/978-3-642-30284-8_11 fatcat:w74pjfkobnhktfijhsz45fsasq

Page 62 of Manufacturing Engineering Vol. 10, Issue 1 [page]

1941 Manufacturing Engineering  
The featured speaker of the evening was none other than the famed Professor Oaks of Waukesha, Wis- consin, the expert on progress and in- vention.  ...  The major worry of the Chapter, as it looks ahead to a new year, will be that of the accommodation of an increased crowd which will wish to {Continued on following page! THE TOOL ENGINEER  ... 

Everything you always wanted to know about compiled and vectorized queries but were afraid to ask

Timo Kersten, Viktor Leis, Alfons Kemper, Thomas Neumann, Andrew Pavlo, Peter Boncz
2018 Proceedings of the VLDB Endowment  
These two state-of-the-art query processing paradigms are fundamentally different in terms of system structure and query execution code. Both paradigms were used to build fast systems.  ...  The query engines of most modern database systems are either based on vectorization or data-centric code generation.  ...  We would like to thank Orri Erling for explaining Virtuoso's vectorized push model and the anonymous reviewers for their valuable feedback.  ... 
doi:10.14778/3275366.3275370 fatcat:bkugfkbgtnhdhcr6oeyof4baj4
« Previous Showing results 1 — 15 out of 51,771 results