Uniform generation in spatial constraint databases and applications

DOI10.1016/J.JCSS.2005.09.008MaRDI QIDQ2495401zbMATH OpenOpenAlexFDO

Authors David Gross-Amblard, Michel de Rougemont

Publication date 30 June 2006

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jcss.2005.09.008

zbMATH Keywords

approximationconstraint databasesdimensionestimatorgeneratorsamplingvolume

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• Publication:4508945
• Uniform Constraint Satisfaction Problems and Database Theory
• Solving spatial constraints with generalized distance geometry
• Building a constraint-based spatial database system: Model, languages, and implementation.
• scientific article; zbMATH DE number 1745031
• On the expressiveness of linear-constraint query languages for spatial databases
• scientific article; zbMATH DE number 1949042
• On the expressiveness of spatial constraint systems

Cites work

• A geometric inequality and the complexity of computing volume
• A random polynomial-time algorithm for approximating the volume of convex bodies
• A sweep-plane algorithm for computing the volume of polyhedra represented in Boolean form
• An expressive language for linear spatial database queries
• Complete geometric query languages
• Finitely representable databases
• Geometric algorithms and combinatorial optimization
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 3549966 (Why is no real title available?)
• scientific article; zbMATH DE number 1261815 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 1086494 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• Monte-Carlo algorithms for the planar multiterminal network reliability problem
• On the convex hull of uniform random points in a simple \(d\)-polytope
• Queries with arithmetical constraints
• Query size estimation by adaptive sampling
• Random generation of combinatorial structures from a uniform distribution
• Random walks and anO*(n5) volume algorithm for convex bodies
• Relational expressive power of constraint query languages
• Relational queries over interpreted structures
• Safe Constraint Queries

Cited in

(2)

• Uniformly Generating Origin Destination Tables
• Knowledge compilation meets uniform sampling

This page was built for publication: Uniform generation in spatial constraint databases and applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2495401)