Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
2,044
On the complexity of join dependencies
- ACM Trans. Database Syst
, 1986
"... In [IO] a method is proposed for decomposing join dependencies (jds) in a relational database using the notion of a hinge. This method was subsequently studied in [ll] and [El. We show how the technique of decompasiti” ” can be used t ” make integrity checking m”re efficient. It turns ““t that it is ..."
Abstract
-
Cited by 20 (2 self)
- Add to MetaCart
In [IO] a method is proposed for decomposing join dependencies (jds) in a relational database using the notion of a hinge. This method was subsequently studied in [ll] and [El. We show how the technique of decompasiti” ” can be used t ” make integrity checking m”re efficient. It turns ““t
Fuzzy Join Dependency in Fuzzy Relational Databases
"... Abstract—The join dependency provides the basis for obtaining lossless join decomposition in a classical relational schema. The existence of Join dependency shows that that the tables always represent the correct data after being joined. Since the classical relational databases cannot handle impreci ..."
Abstract
- Add to MetaCart
Abstract—The join dependency provides the basis for obtaining lossless join decomposition in a classical relational schema. The existence of Join dependency shows that that the tables always represent the correct data after being joined. Since the classical relational databases cannot handle
Fuzzy Join Dependency in Fuzzy Relational Databases
"... Abstract—The join dependency provides the basis for obtaining lossless join decomposition in a classical relational schema. The existence of Join dependency shows that that the tables always represent the correct data after being joined. Since the classical relational databases cannot handle impreci ..."
Abstract
- Add to MetaCart
Abstract—The join dependency provides the basis for obtaining lossless join decomposition in a classical relational schema. The existence of Join dependency shows that that the tables always represent the correct data after being joined. Since the classical relational databases cannot handle
Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces
- IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION
, 1996
"... A new motion planning method for robots in static workspaces is presented. This method proceeds in two phases: a learning phase and a query phase. In the learning phase, a probabilistic roadmap is constructed and stored as a graph whose nodes correspond to collision-free configurations and whose edg ..."
Abstract
-
Cited by 1277 (120 self)
- Add to MetaCart
edges correspond to feasible paths between these configurations. These paths are computed using a simple and fast local planner. In the query phase, any given start and goal configurations of the robot are connected to two nodes of the roadmap; the roadmap is then searched for a path joining these two
Group formation in large social networks: membership, growth, and evolution
- IN KDD ’06: PROCEEDINGS OF THE 12TH ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING
, 2006
"... The processes by which communities come together, attract new members, and develop over time is a central research issue in the social sciences — political movements, professional organizations, and religious denominations all provide fundamental examples of such communities. In the digital domain, ..."
Abstract
-
Cited by 496 (19 self)
- Add to MetaCart
such as the structure of the underlying social networks. We find that the propensity of individuals to join communities, and of communities to grow rapidly, depends in subtle ways on the underlying network structure. For example, the tendency of an individual to join a community is influenced not just by the number
Randomized Gossip Algorithms
- IEEE TRANSACTIONS ON INFORMATION THEORY
, 2006
"... Motivated by applications to sensor, peer-to-peer, and ad hoc networks, we study distributed algorithms, also known as gossip algorithms, for exchanging information and for computing in an arbitrarily connected network of nodes. The topology of such networks changes continuously as new nodes join a ..."
Abstract
-
Cited by 532 (5 self)
- Add to MetaCart
Motivated by applications to sensor, peer-to-peer, and ad hoc networks, we study distributed algorithms, also known as gossip algorithms, for exchanging information and for computing in an arbitrarily connected network of nodes. The topology of such networks changes continuously as new nodes join
Join Dependency Testing, Loomis-Whitney Join, and Triangle Enumeration
"... In this paper, we revisit two fundamental problems in database theory. The first one is called join dependency (JD) testing, where we are given a relation r and a JD, and need to determine whether the JD holds on r. The second problem is called JD existence testing, where we need to determine if the ..."
Abstract
- Add to MetaCart
In this paper, we revisit two fundamental problems in database theory. The first one is called join dependency (JD) testing, where we are given a relation r and a JD, and need to determine whether the JD holds on r. The second problem is called JD existence testing, where we need to determine
Competition in two-sided markets
- The MITRE Corporation
, 1989
"... Many markets involve two groups of agents who interact via “platforms, ” where one group’s benefit from joining a platform depends on the size of the other group that joins the platform. I present three models of such markets: a monopoly platform; a model of competing platforms where agents join a s ..."
Abstract
-
Cited by 374 (2 self)
- Add to MetaCart
Many markets involve two groups of agents who interact via “platforms, ” where one group’s benefit from joining a platform depends on the size of the other group that joins the platform. I present three models of such markets: a monopoly platform; a model of competing platforms where agents join a
International Journal of Electrical and Computer Engineering 2:5 2007 Fuzzy Join Dependency in Fuzzy Relational Databases
"... Abstract—The join dependency provides the basis for obtaining lossless join decomposition in a classical relational schema. The existence of Join dependency shows that that the tables always represent the correct data after being joined. Since the classical relational databases cannot handle impreci ..."
Abstract
- Add to MetaCart
Abstract—The join dependency provides the basis for obtaining lossless join decomposition in a classical relational schema. The existence of Join dependency shows that that the tables always represent the correct data after being joined. Since the classical relational databases cannot handle
Results 1 - 10
of
2,044
