In Figure 3, our third example is where the query result is limited to top-N elements.
在图3中是我们的第三个例子，其中，查询结果被限制在头n个元素。
It's more work to deal with more complicated N+1 query situations.
处理复杂的N+1查询情况需要更多的工作。
The query optimizer might come up with a different query execution plan tailored to provide good performance for fast retrieval of first 'n' rows rather than all the result rows.
查询优化器可能得出一个不同的查询执行计划，这个计划可以专门为最快地获取前'N '行，而不是所有结果行提供良好的性能。
Searching an optimized executive strategy for every complex query is the key of success for database development. In database field, it is still an N-P problem.
对于一个复杂的查询，寻找一个优化的执行策略是数据库系统开发成功的关键所在，此项研究目前在数据库领域仍属于N - P问题。
In candidate sentences selection module, the methods we used to compute the similarity between sentences and query are N-gram modal and Vector Space modal.
相关语句抽取部分的相似度计算使用了N元模型和向量空间模型。
In candidate sentences selection module, the methods we used to compute the similarity between sentences and query are N-gram modal and Vector Space modal.
相关语句抽取部分的相似度计算使用了N元模型和向量空间模型。
应用推荐