A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
Filters
Efficient Integrity Checking for Essential MOF + OCL in Software Repositories
2008
Journal of Object Technology
Preserved Fulltext
By relying on a formal calculus that is suitable with respect to OCL, precise definitions for the problems of query optimization, integrity checking, and view maintenance ...
In the case of OCL, these concepts include aggregation, duplicate values, sort orders, several collection types (sets, bags, ordered sets, lists), negation, and user-defined (potentially recursive) functions ...
CONCLUSIONS AND FURTHER WORK We have addressed an industrially relevant problem by going back to first principles, leveraging research results from object databases to improve the efficiency of software ...
doi:10.5381/jot.2008.7.6.a3
fatcat:ra44xxb3gzcp3d6foivxoqafru
Mining Precision Interfaces From Query Logs
[article]
2017
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We observe that interactive interfaces are designed to express sets of programs; thus, samples of programs-increasingly collected by data systems-may help us build interactive interfaces. ...
Our experiments show that Precision Interfaces can support multiple query languages (SQL and SPARQL), derive Tableau's salient interaction components from OLAP queries, analyze <75k queries in <12 minutes ...
Acknowledgements: We thank Yifan Wu for the initial inspiration, Anant Bhardwaj for data collection, Laura Rettig on early formulations of the problem, and the support of NSF 1527765 and 1564049. ...
arXiv:1712.00078v1
fatcat:uurijgw7afac5ejqy7mwhv4qzm
Steno
2012
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
By increasing the level of abstraction over imperative code, they improve program readability and, crucially, create opportunities for automatic parallelization and optimization. ...
For example, the Language Integrated Query (LINQ) extensions to C# allow the same declarative query to process in-memory collections, and datasets that are distributed across a compute cluster. ...
Acknowledgments We wish to thank Frank McSherry, Mihai Budiu and the PLINQ team for helpful discussions during the development of Steno. ...
doi:10.1145/2345156.1993513
fatcat:lzoqp4hlhnbkjkqw4vft7llw2m
Steno
2011
Proceedings of the 32nd ACM SIGPLAN conference on Programming language design and implementation - PLDI '11
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
By increasing the level of abstraction over imperative code, they improve program readability and, crucially, create opportunities for automatic parallelization and optimization. ...
For example, the Language Integrated Query (LINQ) extensions to C# allow the same declarative query to process in-memory collections, and datasets that are distributed across a compute cluster. ...
Acknowledgments We wish to thank Frank McSherry, Mihai Budiu and the PLINQ team for helpful discussions during the development of Steno. ...
doi:10.1145/1993498.1993513
dblp:conf/pldi/MurrayIY11
fatcat:t4a2zw6j3rfwljjrxmmsp2tkxa
Steno
2011
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
By increasing the level of abstraction over imperative code, they improve program readability and, crucially, create opportunities for automatic parallelization and optimization. ...
For example, the Language Integrated Query (LINQ) extensions to C# allow the same declarative query to process in-memory collections, and datasets that are distributed across a compute cluster. ...
Acknowledgments We wish to thank Frank McSherry, Mihai Budiu and the PLINQ team for helpful discussions during the development of Steno. ...
doi:10.1145/1993316.1993513
fatcat:p6ngyj2lavduhe5gpgm2qv5evi
Efficient runtime invariant checking
2008
Proceedings of the 2008 international workshop on dynamic analysis held in conjunction with the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA 2008) - WODA '08
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The framework supports (1) declarative specification of arbitrary invariants using high-level queries, with easy use of information from any data in the execution, (2) powerful analysis and transformations ...
for automatic generation of instrumentation for efficient incremental checking of invariants, and (3) convenient mechanisms for reporting errors, debugging, and taking preventive or remedial actions, ...
The experiments include checking invariants about (1) abstract syntax tree (AST) transformations on programs of varying sizes between 400 and 16000 AST nodes, (2) Kerberos authentication used by a SMB ...
doi:10.1145/1401827.1401837
dblp:conf/issta/GorbovitskiRLS08
fatcat:gy2phwybrfe5zgj5sfl4lnlrt4
GA based Ensemble Classifier for Efficient Visual Content Information Retrieval
2017
International Journal of Computer Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
A Gene Based Similarity Threshold Classifier (GSTC) Technique is proposed in order to improve the performance of visual content based video retrieval with higher precision, recall, F1 Measure and minimum ...
Finally, GSTC Technique used genetic algorithm in order to discover the optimal similarity threshold value in population with aid of measured fitness function. ...
The similarity threshold value was increment from zero to one by 0.01. ...
doi:10.5120/ijca2017915491
fatcat:2srjmeojo5hufabjqfvnvqqfbm
Alias analysis for optimization of dynamic languages
2010
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This paper describes the development and experimental evaluation of a may-alias analysis for a full dynamic objectoriented language, for program optimization by incrementalization and specialization. ...
Effective incrementalization and specialization of dynamic languages require precise and scalable alias analysis. ...
Consider optimization by incrementalization, which replaces expensive queries with inexpensive retrievals of results that are efficiently incrementally maintained at updates to values on which the query ...
doi:10.1145/1899661.1869635
fatcat:inx6qiujbfh65cx544xpl3oy44
Alias analysis for optimization of dynamic languages
2010
Proceedings of the 6th symposium on Dynamic languages - DLS '10
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This paper describes the development and experimental evaluation of a may-alias analysis for a full dynamic objectoriented language, for program optimization by incrementalization and specialization. ...
Effective incrementalization and specialization of dynamic languages require precise and scalable alias analysis. ...
Consider optimization by incrementalization, which replaces expensive queries with inexpensive retrievals of results that are efficiently incrementally maintained at updates to values on which the query ...
doi:10.1145/1869631.1869635
dblp:conf/dls/GorbovitskiLSRT10
fatcat:wn2qlurqgbbrvmtpvfht4qmoyq
From clarity to efficiency for distributed algorithms
2012
Proceedings of the ACM international conference on Object oriented programming systems languages and applications - OOPSLA '12
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
We present new optimizations that automatically transform complex synchronization conditions into incremental updates of necessary auxiliary values as messages are sent and received. ...
We have developed an operational semantics of the language, implemented a prototype of the compiler and the optimizations, and successfully used the language and implementation on a variety of important ...
Lamport, Nancy Lynch, Lambert Meertens, Stephan Merz, Don Porter, Michel Raynal, John Reppy, Gun Sirer, Doug Smith, Robbert van Renesse, and anonymous reviewers. ...
doi:10.1145/2384616.2384645
dblp:conf/oopsla/LiuSLG12
fatcat:jwip7rimbjgehkpbjquffagtya
PI2: Generating Visual Analysis Interfaces From Queries
[article]
2022
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Other Versions
queries for the task, and implement the interface using a combination of visualization, browser, server, and database technologies. ...
PI2 analyzes queries syntactically and represents a set of queries using a novel Difftree structure that encodes systematic variations between query abstract syntax trees. ...
This is expected as PI 2 is not optimized for scalability, and is dominated by (1) increased number of search states, (2) higher cost to estimate the navigation cost due to the larger number of queries ...
arXiv:2107.08203v5
fatcat:eifyzf7gjzhzzcigqs6egrbiu4
Mining Precision Interfaces From Query Logs
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Interactive tools make data analysis more efficient and more accessible to end-users by hiding the underlying query complexity and exposing interactive widgets for the parts of the query that matter to ...
Our experiments on the Sloan Digital Sky Survey query log suggest that Precision Interfaces can generate useful interfaces for simple unanticipated tasks, and our optimizations can generate interfaces ...
The sliding window and LCA pruning optimizations help reduce the runtime by multiple orders of magnitude without changing the output interfaces. ...
arXiv:1904.02344v2
fatcat:mwmqrfwjlve4ldtnoeqinmu46u
How to Architect a Query Compiler
2016
Proceedings of the 2016 International Conference on Management of Data - SIGMOD '16
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We attempt to remedy this by exploring the key causes of technical challenges in need of well founded solutions, and by gathering the most relevant ideas and approaches from the PL and compilers communities ...
for easy digestion by database researchers. ...
Acknowledgments We thank Vojin Jovanovic and Manohar Jonalagedda for insightful discussions that helped to improve this paper. This work was supported by NCCR MARVEL and ERC grant 279804. ...
doi:10.1145/2882903.2915244
dblp:conf/sigmod/ShaikhhaKPBD016
fatcat:tlwazhetpna4pmmel7iscxmqfm
Continuous model validation using reference attribute grammars
2018
Proceedings of the 11th ACM SIGPLAN International Conference on Software Language Engineering - SLE 2018
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Just like current software systems, models are characterised by increasing complexity and rate of change. Yet, these models only become useful if they can be continuously evaluated and validated. ...
This approach is evaluated using a scalable benchmark for incremental model editing and the JastAdd RAG system. ...
WASP) funded by the Knut and Alice Wallenberg Foundation (KAW). ...
doi:10.1145/3276604.3276616
dblp:conf/sle/MeySHSKFOA18
fatcat:ajpm5ct4lvb4rpknnewuiqkca4
Dynamic Query-Based Debugging
[chapter]
1999
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
To speed up dynamic query evaluation, our debugger (implemented in portable Java) uses a combination of program instrumentation, load-time code generation, query optimization, and incremental reevaluation ...
Experiments and a query cost model show that selection queries are efficient in most cases, while more costly join queries are practical when query evaluations are infrequent or query domains are small ...
This work was funded in part by Sun Microsystems, the State of California MICRO program, and by the National Science Foundation under CAREER grant CCR96-24458 and grants CCR92-21657 and CCR95-05807. ...
doi:10.1007/3-540-48743-3_7
fatcat:daguvwafbrhmrpkgxcxp4nmvlq
« Previous
Showing results 1 — 15 out of 1,471 results