Browsing databases with constraint hierarchies

DOI10.1007/s10660-008-9016-yzbMath1144.68312OpenAlexW2082806082MaRDI QIDQ934960

Levent V. Orman

Publication date: 31 July 2008

Published in: Electronic Commerce Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10660-008-9016-y

zbMATH Keywords

incremental searchelectronic marketsmarket searchconstraint hierarchiesdata typingdatabase applicationdatabase browsing

Mathematics Subject Classification ID

Searching and sorting (68P10) Database theory (68P15)

Cites Work

• Unnamed Item
• Economic incentives in software design
• SmartClients: Constraint satisfaction as a paradigm for scaleable intelligent information systems
• Flexible query answering systems. 5th international conference, FQAS 2002, Copenhagen, Denmark, October 27--29, 2002. Proceedings.
• Dynamic Routing and Operational Controls in Workflow Management Systems
• Reducing Buyer Search Costs: Implications for Electronic Marketplaces

This page was built for publication: Browsing databases with constraint hierarchies