Browsing databases with constraint hierarchies

DOI10.1007/S10660-008-9016-YMaRDI QIDQ934960zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 2086287
• scientific article; zbMATH DE number 2080493
• scientific article; zbMATH DE number 1929254
• scientific article; zbMATH DE number 2086311
• Constraint databases: promising technology or just intellectual exercise?

Cites work

• scientific article; zbMATH DE number 5046290 (Why is no real title available?)
• Dynamic Routing and Operational Controls in Workflow Management Systems
• Economic incentives in software design
• Flexible query answering systems. 5th international conference, FQAS 2002, Copenhagen, Denmark, October 27--29, 2002. Proceedings.
• Reducing Buyer Search Costs: Implications for Electronic Marketplaces
• SmartClients: Constraint satisfaction as a paradigm for scaleable intelligent information systems

Cited in

(3)

• Lattice model of browsable data spaces
• scientific article; zbMATH DE number 2086287 (Why is no real title available?)
• scientific article; zbMATH DE number 2086311 (Why is no real title available?)

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

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