Lets say i have an app which fetches all phone contacts. Then checks in the database to find any contact is using the same app. If so then add him as a friend. Lets say a user has 1000 contacts and total users in a database are 1 million. In that case it has to check these 1000 contacts against 1 million users ? Is there any other way i can do a fast lookup ?
2条回答 默认 最新
- dongyuluan7494 2014-06-16 11:49关注
You can check each contact against a 1M rows table, and repeat 1000 times. That would be sub optimal.
I would advice to create a temporary table with the 1000 contacts, create and index on the unique_id of each contact, then join the temporary table with your 1M table on which you of couse already have an index on the unique_id. Store the result in another table (for example "contacts_to_add") and delete the temporary one. (MySQL does this automatically when you use the
CREATE TEMPORARY TABLE
sentence)This should be fairly quick.
本回答被题主选为最佳回答 , 对您是否有帮助呢?解决 无用评论 打赏 举报
悬赏问题
- ¥30 Unity接入微信SDK 无法开启摄像头
- ¥20 有偿 写代码 要用特定的软件anaconda 里的jvpyter 用python3写
- ¥20 cad图纸,chx-3六轴码垛机器人
- ¥15 移动摄像头专网需要解vlan
- ¥20 access多表提取相同字段数据并合并
- ¥20 基于MSP430f5529的MPU6050驱动,求出欧拉角
- ¥20 Java-Oj-桌布的计算
- ¥15 powerbuilder中的datawindow数据整合到新的DataWindow
- ¥20 有人知道这种图怎么画吗?
- ¥15 pyqt6如何引用qrc文件加载里面的的资源