Results 251 to 260 of about 316,576 (301)
Some of the next articles are maybe not open access.
Join Reordering by Join Simulation
2009 IEEE 25th International Conference on Data Engineering, 2009We introduce a framework for reordering join pipelines at runtime in a database system. This framework incorporates novel techniques for simulating the execution of a join pipeline using random samples and statistical summaries. Our simulation techniques provide accurate runtime cardinality estimates along all alternative execution paths of a join ...
Chaitanya Mishra, Nick Koudas
openaire +1 more source
Proceedings of the 8th ACM international symposium on Advances in geographic information systems, 2000
Spatial applications frequently need to join two data sets based on some spatial relationship between objects in the two data sets. This operation, called a spatial join, is an expensive operation and in the past many algorithms have been proposed for evaluating the spatial join operation on a single processor system.
Jignesh M. Patel, David J. DeWitt
openaire +1 more source
Spatial applications frequently need to join two data sets based on some spatial relationship between objects in the two data sets. This operation, called a spatial join, is an expensive operation and in the past many algorithms have been proposed for evaluating the spatial join operation on a single processor system.
Jignesh M. Patel, David J. DeWitt
openaire +1 more source
ACM Transactions on Database Systems, 1991
CITATO ANCHE IN COMPUTING REVIEWS ...
NEGRI, MAURO, PELAGATTI, GIUSEPPE
openaire +1 more source
CITATO ANCHE IN COMPUTING REVIEWS ...
NEGRI, MAURO, PELAGATTI, GIUSEPPE
openaire +1 more source
Journal of Graph Theory, 1996
Given a multigraph \(G\) and an even subset \(T\) of \(V(G)\), a \(T\)-join is a set \(J \subseteq E(G)\) such that \(G(V,J)\) has odd degree of the nodes of \(T\) and even degree of the nodes of \(V \backslash T\), where \(V = V(G)\). A cut \(\delta (S)\) of \(G\) is a \(T\)-cut if \(S \cap T\) is an odd set.
Codato, P. +2 more
openaire +3 more sources
Given a multigraph \(G\) and an even subset \(T\) of \(V(G)\), a \(T\)-join is a set \(J \subseteq E(G)\) such that \(G(V,J)\) has odd degree of the nodes of \(T\) and even degree of the nodes of \(V \backslash T\), where \(V = V(G)\). A cut \(\delta (S)\) of \(G\) is a \(T\)-cut if \(S \cap T\) is an odd set.
Codato, P. +2 more
openaire +3 more sources
Understanding Joining — And Not Joining
2007Following the discussion of the growing professionalization in groups, this chapter presents two new sorts of evidence from surveys. First, it documents responses from group managers giving a top—down insider perspective on joining. Secondly, it reports on a survey of (environmental) non-members.
Grant Jordan, William A. Maloney
openaire +1 more source
, 2018 The key idea behind Inspector Joins is that during the I/O partitioning phase of a hash-based join, we have the opportunity to look at the actual data itself and then use this knowledge in two ways: (1) to create specialized indexes, specific to the given query on the given data, for optimizing the CPU cache performance of the subsequent join phase of ...
Shimin Chen +3 more
openaire +1 more source
ACM SIGMOD Record
Over the last decade, worst-case optimal join (WCOJ) algorithms have emerged as a new paradigm for one of the most fundamental challenges in query processing: computing joins efficiently. Such an algorithm can be asymptotically faster than traditional binary joins, all the while remaining simple to understand and implement.
Yisu Remy Wang, Max Willsey, Dan Suciu
openaire +1 more source
Over the last decade, worst-case optimal join (WCOJ) algorithms have emerged as a new paradigm for one of the most fundamental challenges in query processing: computing joins efficiently. Such an algorithm can be asymptotically faster than traditional binary joins, all the while remaining simple to understand and implement.
Yisu Remy Wang, Max Willsey, Dan Suciu
openaire +1 more source
2010
Semi-joins and anti-joins are two closely related join methods (options of join methods, actually) that the Oracle optimizer can choose to apply when retrieving information. The SQL language is designed to specify the set of data that the user wishes to retrieve, but to leave the decisions as to how to actually navigate to the data up to the database ...
Karen Morton +4 more
openaire +1 more source
Semi-joins and anti-joins are two closely related join methods (options of join methods, actually) that the Oracle optimizer can choose to apply when retrieving information. The SQL language is designed to specify the set of data that the user wishes to retrieve, but to leave the decisions as to how to actually navigate to the data up to the database ...
Karen Morton +4 more
openaire +1 more source
ACM Transactions on Database Systems, 1987
In new application areas of relational database systems, such as artificial intelligence, the join operator is used more extensively than in conventional applications. In this paper, we propose a simple data structure, called a join index, for improving the performance of joins in the context of complex queries.
openaire +1 more source
In new application areas of relational database systems, such as artificial intelligence, the join operator is used more extensively than in conventional applications. In this paper, we propose a simple data structure, called a join index, for improving the performance of joins in the context of complex queries.
openaire +1 more source
22nd International Conference on Data Engineering (ICDE'06), 2006
We present a secure network service for sovereign information sharing whose only trusted component is an off-theshelf secure coprocessor. The participating data providers send encrypted relations to the service that sends the encrypted results to the recipients.
Rakesh Agrawal 0001 +3 more
openaire +1 more source
We present a secure network service for sovereign information sharing whose only trusted component is an off-theshelf secure coprocessor. The participating data providers send encrypted relations to the service that sends the encrypted results to the recipients.
Rakesh Agrawal 0001 +3 more
openaire +1 more source