问个问题,顶、文章、用户的关系是如保存的?(内有例子) - V2EX
请不要在回答技术问题时复制粘贴 AI 生成的内容
androidBrant

问个问题,顶、文章、用户的关系是如保存的?(内有例子)

  •  
  •   androidBrant Dec 4, 2013 3186 views
    This topic created in 4542 days ago, the information mentioned may be changed or developed.
    举个例子,糗事百科每个帖子都有顶这个功能,但每个人只能顶一次,那顶的人,和帖子的关系是如何保存的(数据库如何设计的?)?
    7 replies    1970-01-01 08:00:00 +08:00
    raincious
        1
    raincious  
       Dec 4, 2013
    猜想类似于

    SELECT `t`.`topic`, `like`.`liked` FROM `topic` AS `t`
    LEFT JOIN `liked` AS `like` ON `like`.`topicID` = `t`.`topicID` AND `like`.`likerID` = %CURRENTUSERID%

    然后每次顶好了,liked表里面加一条什么的。

    当然这样数据库负担很大,或许需要拆成两个SELECT然后在程序里合并结果什么的。当然,拆来来之后,都能直接上NOSQL了。
    spoony
        2
    spoony  
       Dec 4, 2013
    Token+Postid 的Hashtable
    hustlzp
        3
    hustlzp  
       ec 4, 2013   1
    一张表,2个field:user_id, post_id。

    然后主键设为user_id+post_id的组合。

    这样应该就保证一个人只能顶一篇文章一次。
    mechille
        4
    mechille  
       Dec 4, 2013
    提供个思路(没实际操作过,欢迎拍砖):在POST表建一个字段post_user。

    里边存入user的id,半角逗号分割。

    下次直接用find_in_set判断当前这个user是否存在于这个post的post_user里就可以了
    ayang23
        5
    ayang23  
       Dec 4, 2013
    @mechille 几千个id组成字符串对mysql的io也有不少影响,而且程序还得处理,效率不一定比left join好
    mechille
        6
    mechille  
       Dec 4, 2013
    @ayang23 那么三楼方案应该是最佳的了。插入用REPLACE INTO 或者 INSERT INTO ... ON DUPLICATE KEY UPDATE。检索用 substring_index 做关系(应该比like效率高吧)
    slixurd
        7
    slixurd  
       Dec 4, 2013
    2楼的hashtable显然更好啊,如果不需要查看是谁顶帖的情况下
    About     Help     Advertise     Blog     API     FAQ     Solana     3074 Online   Highest 6679       Select Language
    创意工作者们的社区
    World is powered by solitude
    VERSION: 3.9.8.5 48ms UTC 14:49 PVG 22:49 LAX 07:49 JFK 10:49
    Do have faith in what you're doing.
    ubao msn snddm index pchome yahoo rakuten mypaper meadowduck bidyahoo youbao zxmzxm asda bnvcg cvbfg dfscv mmhjk xxddc yybgb zznbn ccubao uaitu acv GXCV ET GDG YH FG BCVB FJFH CBRE CBC GDG ET54 WRWR RWER WREW WRWER RWER SDG EW SF DSFSF fbbs ubao fhd dfg ewr dg df ewwr ewwr et ruyut utut dfg fgd gdfgt etg dfgt dfgd ert4 gd fgg wr 235 wer3 we vsdf sdf gdf ert xcv sdf rwer hfd dfg cvb rwf afb dfh jgh bmn lgh rty gfds cxv xcv xcs vdas fdf fgd cv sdf tert sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf shasha9178 shasha9178 shasha9178 shasha9178 shasha9178 liflif2 liflif2 liflif2 liflif2 liflif2 liblib3 liblib3 liblib3 liblib3 liblib3 zhazha444 zhazha444 zhazha444 zhazha444 zhazha444 dende5 dende denden denden2 denden21 fenfen9 fenf619 fen619 fenfe9 fe619 sdf sdf sdf sdf sdf zhazh90 zhazh0 zhaa50 zha90 zh590 zho zhoz zhozh zhozho zhozho2 lislis lls95 lili95 lils5 liss9 sdf0ty987 sdft876 sdft9876 sdf09876 sd0t9876 sdf0ty98 sdf0976 sdf0ty986 sdf0ty96 sdf0t76 sdf0876 df0ty98 sf0t876 sd0ty76 sdy76 sdf76 sdf0t76 sdf0ty9 sdf0ty98 sdf0ty987 sdf0ty98 sdf6676 sdf876 sd876 sd876 sdf6 sdf6 sdf9876 sdf0t sdf06 sdf0ty9776 sdf0ty9776 sdf0ty76 sdf8876 sdf0t sd6 sdf06 s688876 sd688 sdf86