A5089065417- Advanced Database Systems and Queries
- Data Management and Algorithms
- Algorithms and Data Compression
- semigroups and automata theory
- Semantic Web and Ontologies
- Logic, programming, and type systems
- Data Mining Algorithms and Applications
- Logic, Reasoning, and Knowledge
- Graph Theory and Algorithms
- Computability, Logic, AI Algorithms
- Data Quality and Management
- Natural Language Processing Techniques
- Formal Methods in Verification
- Distributed systems and fault tolerance
- Parallel Computing and Optimization Techniques
- Cloud Computing and Resource Management
- DNA and Biological Computing
- Distributed and Parallel Computing Systems
- Complexity and Algorithms in Graphs
- Cellular Automata and Applications
- Rough Sets and Fuzzy Logic
- Interconnection Networks and Systems
- Cryptography and Data Security
- Privacy-Preserving Technologies in Data
- Stochastic Gradient Optimization Techniques
Stanford University
2014-2023
Ben-Gurion University of the Negev
2022
University of Maryland, College Park
2022
Palo Alto University
2016-2019
University of Florida
2014
Cambridge University Press
2012
Stanford Medicine
2001
HeidelbergCement (United States)
1996
Saarland University
1996
Polish Academy of Sciences
1996
We consider the problem of analyzing market-basket data and present several important contributions. First, we a new algorithm for finding large itemsets which uses fewer passes over than classic algorithms, yet candidate methods based on sampling. investigate idea item reordering, can improve low-level efficiency algorithm. Second, way generating “implication rules,” are normalized both antecedent consequent truly implications (not simply measure co-occurrence), show how they produce more...
Decision support applications involve complex queries on very large databases. Since response times should be small, query optimization is critical. Users typically view the data as multidimensional cubes. Each cell of cube a consisting an aggregation interest, like total sales. The values many these cells are dependent other in cube. A common and powerful technique to materialize some or all rather than compute them from raw each time. Commercial systems differ mainly their approach...
A model of protection mechanisms in computing systems is presented and its appropriateness argued. The “safety” problem for under this to determine a given situation whether subject can acquire particular right an object. In restricted cases, it be shown that decidable, i.e. there algorithm system configuration safe. general, surprisingly weak assumptions, cannot decided if Various implications fact are discussed.
The following abstract problem models several practical problems in computer science and operations research: given a list L of real numbers between 0 l, place the elements into minimum number $L^ * $ “bins” so that no bin contains whose sum exceeds l. Motivated by likelihood an excessive amount computation will be required any algorithm which actually determines optimal placement, we examine performance simple algorithms obtain “good” placements. first-fit places each number, succession,...
We consider economical representations for the path information in a directed graph. A graph $G^t $ is said to be transitive reduction of G provided that (i) has from vertex u v if and only v, (ii) there no with fewer arcs than satisfying condition (i). Though graphs cycles may have more one such representation, we select natural canonical representative as graphs. It shown time complexity best algorithm finding same compute closure or perform Boolean matrix multiplication.
We consider the question of how powerful a relational query language should be and state two principles that we feel any satisfy. show although algebra calculus satisfy these principles, there are certain queries involving least fixed points cannot expressed by languages, yet also principles. then various extensions to enable it answer such queries. Finally, discuss our in terms new programming oriented model for
We consider the problem of analyzing market-basket data and present several important contributions. First, we a new algorithm for finding large itemsets which uses fewer passes over than classic algorithms, yet candidate methods based on sampling. investigate idea item reordering, can improve low-level efficiency algorithm. Second, way generating “implication rules,” are normalized both antecedent consequent truly implications (not simply measure co-occurrence), show how they produce more...
Several methods for implementing database queries expressed as logical rules are given and they compared efficiency. One method, called “magic sets,” is a general algorithm rewriting so that may be implemented bottomUP (= forward chaining) in way cuts down on the irrelevant facts generated. The advantage of this scheme by working bottom-up, we can take efficient doing massive joins. Two other ad hoc ways “linear” rules, i.e., where at most one predicate any body recursive. These
Decision support applications involve complex queries on very large databases. Since response times should be small, query optimization is critical. Users typically view the data as multidimensional cubes. Each cell of cube a consisting an aggregation interest, like total sales. The values many these cells are dependent other in cube. A common and powerful technique to materialize some or all rather than compute them from raw each time. Commercial systems differ mainly their approach...